16059
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22032
- Proper Divisor Sum (Aliquot Sum)
- 5973
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10400
- Möbius Function
- -1
- Radical
- 16059
- Omega Function (Ω)
- 3
- 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
- 53
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of 7's in all partitions of n.at n=40A024791
- Number of partitions of n into parts not of the form 11k, 11k+4 or 11k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 4 are greater than 1.at n=42A035947
- Numbers whose base-4 representation contains exactly three 2's and four 3's.at n=26A045152
- Reverse binary expansion of the factorial numbers.at n=10A143257
- Number of binary strings of length n with no substrings equal to 0001, 0110, or 0111.at n=27A164476
- Imbalance of the sum of largest parts of all partitions of n.at n=34A194809
- a(n) = Sum_{i=0..n} digsum_7(i)^4, where digsum_7(i) = A053828(i).at n=22A231679
- Number of 4-cycles in the n X n king graph.at n=37A288918
- Number of n X n 0..1 arrays with no 1 adjacent to 1 king-move neighboring 1.at n=3A297066
- Number of nX4 0..1 arrays with no 1 adjacent to 1 king-move neighboring 1.at n=3A297069
- T(n,k)=Number of nXk 0..1 arrays with no 1 adjacent to 1 king-move neighboring 1.at n=24A297073