9650
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18042
- Proper Divisor Sum (Aliquot Sum)
- 8392
- 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
- 3840
- Möbius Function
- 0
- Radical
- 1930
- Omega Function (Ω)
- 4
- 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
- 60
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Numbers that are the sum of 4 positive 6th powers.at n=30A003360
- Triangle of multi-edge stars with n edges by cyclotomic index.at n=70A010358
- Expansion of 1/((1-5x)(1-7x)(1-9x)(1-10x)).at n=3A028184
- Number of ways to partition n elements into pie slices of different sizes.at n=31A032153
- Number of step cyclic shifted sequence structures using exactly three different symbols.at n=13A056435
- Numbers k that can be expressed as k = w+x = y*z with w*x = (y+z)^2 where w, x, y, and z are all positive integers.at n=19A057369
- Number of self-avoiding polygons of area n with any number of (self-avoiding polygon) holes on square lattice (not allowing rotations).at n=8A057409
- a(n) = 2*3^n+2^(2n-1)*(n-2).at n=6A084847
- a(n) = Sum_{k=0..n} Fibonacci(n-k)*n^k.at n=6A101220
- Partial sums of A102540 (primes that are not Chen primes).at n=32A115606
- Sum of product of Fibonacci and triangular numbers.at n=11A117152
- Main diagonal of triangular array T: T(j,1) = 1 for ((j-1) mod 6) < 3, else 0; T(j,k) = T(j-1,k-1) + T(j,k-1) for 2 <= k <= j.at n=14A129339
- Inverse binomial transform of decimal expansion of Pi.at n=13A130597
- Number of (n+1)X7 0..3 arrays with each element of every 2X2 subblock being the sum mod 4 of two others.at n=0A183851
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with each element of every 2X2 subblock being the sum mod 4 of two others.at n=15A183854
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with each element of every 2X2 subblock being the sum mod 4 of two others.at n=20A183854
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 197", based on the 5-celled von Neumann neighborhood.at n=23A270718
- Indices where records occur in A265432.at n=46A272675
- Number of maximal matchings in the n-Moebius ladder.at n=11A284710
- a(n) = PrimePi(n^3) - PrimePi(n)^3, where PrimePi = A000720.at n=52A291538