7946
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12420
- Proper Divisor Sum (Aliquot Sum)
- 4474
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3808
- Möbius Function
- -1
- Radical
- 7946
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 96
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- a(n) = floor( n*(n-1)*(n-2)/10 ).at n=44A011892
- Numbers k such that the continued fraction for sqrt(k) has period 21.at n=39A020360
- Composite numbers x such that sigma(x+120) = sigma(x)+120.at n=21A054985
- McKay-Thompson series of class 32B for the Monster group.at n=34A058630
- Fibonacci(p-J(p,5)) mod p^2, where p is the n-th prime and J is the Jacobi symbol.at n=32A113650
- Number of base 22 circular n-digit numbers with adjacent digits differing by 1 or less.at n=7A124715
- Number of permutations of floor(i*9/7), i=0..n-1, with all sums of two and three adjacent terms respectively unique.at n=7A147933
- Number of permutations of floor(i*9/7), i=0..n-1, with all sums of 2 through 4 adjacent terms respectively unique.at n=7A147942
- Number of permutations of floor(i*9/7), i=0..n-1, with all sums of 2 through 5 adjacent terms respectively unique.at n=7A147951
- a(n) = Least i in range [A165583(n),A165583(n+1)] for which abs(A165582(i)) gets the maximum value in that range.at n=31A165584
- Partial sums of A050705.at n=44A177791
- Inverse of Riordan array ((1-x)(1-x^2)(1-x^3)/(1-x^6), x(1-x)(1-x^2)(1-x^3)/(1-x^6)).at n=37A185967
- Monotonic ordering of set S generated by these rules: if x and y are in S then x^2 + y^2 is in S, and 1 is in S.at n=45A192476
- Number of n X 4 0..2 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=15A201273
- Number of (n+3) X 5 0..1 matrices with each 4 X 4 subblock idempotent.at n=13A224562
- Bernoulli number B_{n} has denominator 354.at n=18A255684
- Coordination sequence for (2,5,7) tiling of hyperbolic plane.at n=20A265066
- Number of 2Xn arrays containing n copies of 0..2-1 with every element equal to at least one horizontal or vertical neighbor and the top left element equal to 0.at n=9A267902
- a(n) is the sum of the terms of the symmetric square array defined by M(i,j) = prime(i)+i-j for i >= j and M(i,j) = M(j,i) if i < j.at n=14A308731
- a(n) = 1*2 - 3 + 4*5 - 6 + 7*8 - 9 + 10*11 - 12 + 13*14 - ... + (up to n).at n=42A319493