16200
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
- 60
- Divisor Sum
- 56265
- Proper Divisor Sum (Aliquot Sum)
- 40065
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 0
- Radical
- 30
- Omega Function (Ω)
- 9
- 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
- 159
- 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
- yes
- Achilles Number
- yes
- Perfect Power
- no
- Smooth Number
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Expansion of e.g.f. (1/2)*(exp(2*x + x^2) + 1).at n=8A000902
- a(n) = 2^(n-1)*(2^n - 1)*Product_{j=1..n-1} (2^j + 1).at n=4A005477
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/26 ).at n=27A011936
- Number of symmetrically inequivalent coincidence rotations of icosian ring of index n.at n=88A031366
- Words over signatures (derived from multisets and multinomials).at n=42A035796
- Coordination sequence for lattice D*_90 (with edges defined by l_1 norm = 1).at n=2A035830
- Coordination sequence for diamond structure D^+_90. (Edges defined by l_1 norm = 1.)at n=2A035921
- For all n, if d is recursively applied to a(n) exactly 6 times then the fixed point of d-iteration is just reached.at n=18A036458
- First differences of A037260.at n=38A037261
- Number of functions from a set to itself such that the sizes of the preimages of the individual elements in the range form the n-th partition in Abramowitz and Stegun order.at n=27A049009
- a(n) = Product_{d|n, d^2<=n} (d+n/d); a(1)=1.at n=43A050214
- For n>3: a(n) is a multiple of three distinct earlier terms.at n=15A060301
- Numerator of 1/det(M) where M is the n X n matrix with M[i,j] = 1/lcm(i,j).at n=5A060841
- Numbers k that, when expressed in base 5 and then interpreted in base 9, give a multiple of k.at n=29A062931
- Smallest number with persistence n for the sort-and-subtract-sequence.at n=20A065641
- Numbers k such that phi(prime(k)-1) == 0 (mod k).at n=9A067733
- First differences of A069475, successive differences of (n+1)^6-n^6.at n=20A069476
- Numbers k such that the k-th difference between 2 successive primes equals the squarefree part of k.at n=27A078691
- Numbers n such that n and tau(n) = A000005(n) have the same prime factors (ignoring multiplicity).at n=43A081381
- Non-perfect powers k for which q = A051903(k)/A051904(k) is an integer, A051904(k) > 1.at n=1A093770