16564
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 29988
- Proper Divisor Sum (Aliquot Sum)
- 13424
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8000
- Möbius Function
- 0
- Radical
- 8282
- 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
- 128
- 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
- Smallest number that requires n iterations of the bi-unitary totient function (A116550) to reach 1.at n=44A005424
- Positive numbers k such that k = x^5 + y^5 has a solution in nonzero integers x, y.at n=40A020896
- Expansion of Product_{m>=1} (1+x^m)^A000009(m).at n=23A050342
- Number of pentagonal regions in regular n-gon with all diagonals drawn.at n=36A067152
- a(n) = 3*a(n-1)-a(n-2)-2*a(n-3)+a(n-4), n>5.at n=12A107298
- Center antidiagonal four in a tri-antidiagonal n-th Matrix generated triangular sequence: first element as 4==m[1,1,1].at n=48A124028
- Integers k such that 10^k + 79 is a prime number.at n=25A135131
- Numbers expressible as the difference of two nonnegative fifth powers.at n=26A152045
- 4 times heptagonal numbers: a(n) = 2*n*(5*n-3).at n=41A153784
- Difference of two positive 5th powers.at n=20A181124
- a(n) = 7^n - 3^n.at n=5A190541
- Monotonic ordering of nonnegative differences 7^i-3^j, for 40>= i>=0, j>=0.at n=24A192154
- Triangle read by rows, T(n, k) = 4^k*S_4(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.at n=16A225467
- Triangle read by rows, k!*S_4(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.at n=16A225473
- Number of overcompositions of n minus the number of overpartitions of n.at n=12A237045
- G.f.: Sum_{k>=0} A000041(k)^2 * x^k / Sum_{k>=0} A000009(k) * x^k.at n=16A304988
- Numbers that are the sum of nine fourth powers in exactly ten ways.at n=32A345852