9852
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23016
- Proper Divisor Sum (Aliquot Sum)
- 13164
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3280
- Möbius Function
- 0
- Radical
- 4926
- 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
- 210
- 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
- An upper bound for linearized chord diagrams.at n=8A022491
- a(n) = floor(surface area of a sphere with radius n).at n=27A066644
- Number of partitions of n into squarefree parts.at n=41A073576
- Triangle read by rows: T(n,k) is number of Dyck paths of semilength n having k ascents of length 1 starting at an even level.at n=66A102404
- Number of Dyck paths of semilength n having no ascents of length 1 that start at an even level.at n=11A102406
- Row sums of a q-Catalan triangle for q=2.at n=5A154828
- G.f.: A(x) = exp( Sum_{n>=1} 3*A038500(n) * x^n/n ), where A038500 is the highest power of 3 dividing n.at n=29A161809
- Expansion of Product_{k>0} (1 - x^k)^(2^(k-1)) in powers of x.at n=18A200751
- a(n) is the number of partitions of n such that the number of parts having multiplicity > 1 is a part.at n=35A241408
- Numbers k such that Bernoulli number B_k has denominator 2730.at n=36A249134
- Number of n X 3 0..2 arrays with no element unequal to a strict majority of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=11A279897
- Smallest number that is the sum of n successive primes and also the sum of n successive semiprimes, n > 1.at n=32A283873
- G.f.: Product_{n=-oo..+oo} ( 1 + x^n*(1 - x^n)^n ).at n=32A293602
- Number of integer partitions of the n-th squarefree number using squarefree numbers.at n=26A303365
- G.f.: Product_{k>=1, j>=1} 1/(1 - x^(k*j))^2.at n=12A320236
- Approximations up to 2^n for the 2-adic integer log(5).at n=14A321690
- Approximations up to 2^n for the 2-adic integer log(5).at n=15A321690
- Approximations up to 2^n for the 2-adic integer log(5).at n=16A321690
- Approximations up to 2^n for the 2-adic integer log(5).at n=17A321690
- Nearest integer to 4*Pi*n^2.at n=28A322615