16822
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 27216
- Proper Divisor Sum (Aliquot Sum)
- 10394
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7752
- Möbius Function
- -1
- Radical
- 16822
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 66
- 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
- yes
- Odd
- no
Appears in sequences
- a(0) = 1, a(n) = 20*n^2 + 2 for n>0.at n=29A010010
- a(n) = A088314(n) - A000009(n).at n=48A088571
- Total number of parts in all partitions of n plus the sum of largest parts in all partitions of n plus the number of partitions of n plus n.at n=22A225610
- Sum of the third largest parts of the partitions of n into 10 squarefree parts.at n=51A326635
- Numbers that are the sum of eight fourth powers in eight or more ways.at n=10A345583
- Numbers that are the sum of eight fourth powers in exactly eight ways.at n=8A345840
- Coefficient of x^n in the expansion of 1/( (1-x)^2 * (1-x^3)^2 )^n.at n=6A370275
- Number of subsets of {1..n} with all equal lengths of maximal anti-runs (increasing by more than 1).at n=19A384889