16002
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
- 24
- Divisor Sum
- 39936
- Proper Divisor Sum (Aliquot Sum)
- 23934
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4536
- Möbius Function
- 0
- Radical
- 5334
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 53
- 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
- Number of points on surface of cuboctahedron (or icosahedron): a(0) = 1; for n > 0, a(n) = 10n^2 + 2. Also coordination sequence for f.c.c. or A_3 or D_3 lattice.at n=40A005901
- a(0) = 1, a(n) = 40*n^2 + 2 for n>0.at n=20A010022
- Numbers k such that k divides 2^(k+1) - 2.at n=39A014741
- Positive integers n such that n | (2^n + n/2 - 1).at n=37A015942
- Unbalanced strings of length n.at n=14A027556
- Sorted Galois numbers.at n=35A028689
- Product of a prime and the previous number.at n=30A036689
- Hexagonal matchstick numbers: a(n) = 3*n*(3*n+1).at n=42A045945
- z-value of the solution (x,y,z) to 5/n = 1/x + 1/y + 1/z satisfying 0 < x < y < z and having the largest z-value. The x and y components are in A075249 and A075250.at n=39A075251
- phi(n) plus the n-th prime gives a square.at n=36A116021
- Numbers m such that m^k does not divide the denominator of the m-th generalized harmonic number H(m,k) nor the denominator of the m-th alternating generalized harmonic number H'(m,k), for k = 2.at n=42A128672
- Numbers m such that m^k does not divide the denominator of the m-th generalized harmonic number H(m,k) nor the denominator of the m-th alternating generalized harmonic number H'(m,k), for k = 4.at n=36A128674
- a(n) = p*(p - 1), where p is A000043(n).at n=11A139115
- M*(M-1), where M is Mersenne prime A000668(n).at n=3A139223
- a(n)=2a(n-1) but when sum of digits of 2a(n-1) is greater than 9 take a(n) = largest number < 2a(n-1) which has sum of digits = 9.at n=14A140134
- Weight distribution of [127,22,47] primitive binary BCH code.at n=47A151811
- Weight distribution of [127,113,5] primitive binary BCH code.at n=5A151877
- Partial sums of A165271.at n=38A165273
- Number of n X 3 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=8A207656
- The order of the one-dimensional affine group in the finite fields F_q with q >= 3.at n=41A220211