16881
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23904
- Proper Divisor Sum (Aliquot Sum)
- 7023
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10560
- Möbius Function
- -1
- Radical
- 16881
- 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
- 84
- 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 partitions of n with equal nonzero number of parts congruent to each of 0 and 1 (mod 3).at n=51A035537
- Distinct odd numbers in the numerators of the 1/5-Pascal triangle (by row).at n=44A046624
- Distinct odd numbers in writing first numerator and then denominator of each element to the right of the central elements of the 1/5-Pascal triangle (by row).at n=43A046628
- a(n) = T(4,n), array T given by A048505.at n=8A048509
- Structured heptagonal anti-diamond numbers (vertex structure 7).at n=16A100186
- a(n+3) = a(n) - a(n+1) - a(n+2); a(0) = -5, a(1) = 6, a(2) = 0.at n=27A105580
- Tribonacci-like sequence; a(0)=2, a(1)=1, a(2)=1, a(n) = a(n-1) + a(n-2) + a(n-3).at n=17A141036
- Number of length n+6 0..1 arrays with at most one downstep in every n consecutive neighbor pairs.at n=37A255997
- The sum of the sizes of the minimal fixed points over all compositions of n.at n=14A335712
- a(n) = Sum_{k=2..n} binomial(k,2) * floor(n/k).at n=43A366967