10224
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 30
- Divisor Sum
- 29016
- Proper Divisor Sum (Aliquot Sum)
- 18792
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3360
- Möbius Function
- 0
- Radical
- 426
- Omega Function (Ω)
- 7
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 135
- 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
- Expansion of Product_{m>=1} (1 + m*q^m)^18.at n=4A022646
- Related to Clebsch-Gordan formulas.at n=7A027614
- a(n) = a(n-1) + a(round(2*(n-1)/3)) + a(round((n-1)/3)) with a(1)=1, a(2)=2.at n=32A033500
- Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2) = k; sequence gives values of k.at n=40A048191
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives i values.at n=40A053719
- Numbers k such that sigma(prime(k) + 1) == 0 (mod k).at n=39A067759
- 4 times hexagonal numbers: a(n) = 4*n*(2*n-1).at n=36A085250
- Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n containing k subwords of the type U H^j U or D H^j D for some j>0, where U=(1,1), H=(1,0) and D=(1,-1) (can be easily expressed using RNA secondary structure terminology).at n=52A097100
- Numbers that reach the fixed point 89 under iteration of f(x) = reverse(x) - maxdigit(x).at n=16A097155
- a(n) = 16*(8*prime(n) + 7).at n=21A098823
- Nearest k to j such that k*(2^j-1)-1 is prime where j=A000043(n) and 2^j-1 = Mersenne-prime(n) = A000668(n). If there are two k values equidistant from j, each of which produces a prime, the larger of the two gets added to the sequence.at n=22A101416
- Numbers k for which digitsum(k) + digitsum(k^2) + digitsum(k^3) = digitsum(k^4).at n=21A118470
- 12 times pentagonal numbers: a(n) = 6*n*(3*n-1).at n=24A153792
- a(n) = 512*n - 16.at n=19A157447
- a(n) = 1458*n + 18.at n=6A157505
- Triangle T(n,k) for solving differential equation A'(x)=G(A(x)), G(0)!=0.at n=38A190015
- Number of 3 X n 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors.at n=10A208638
- Numbers k such that the area of a circle of radius k is closer to an integer than the area of any circle whose radius is a smaller positive integer k.at n=11A254714
- Expansion of Product_{k>=1} (1 + x^(2*k+1))^k.at n=44A263149
- Poincaré series for hyperbolic reflection group with Coxeter diagram o---o-(5)-o---o.at n=22A265044