16947
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 28080
- Proper Divisor Sum (Aliquot Sum)
- 11133
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9648
- Möbius Function
- 0
- Radical
- 5649
- 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
- 58
- 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
- no
- Odd
- yes
Appears in sequences
- General partition graphs on n vertices.at n=9A007269
- Shifts left twice under "AGK" (ordered, elements, unlabeled) transform.at n=16A032029
- L-th order palindromes with L > 2.at n=7A089381
- a(1)=1; a(n+1) = Sum_{k=0..a(n) mod n} a(n-k).at n=17A130618
- A triangle sequence of polynomial coefficients:p(x,n)=Sum[Binomial[n, k]*(-x)^k*Sum[StirlingS2[n, m]*x^m, {m, 0, n - k}], {k, 0, n}].at n=44A174859
- Triangle read by rows: T(n, k) = C(n, k)*C(2*k, k)/(k+1) - sum(j = 0..k, (-1)^j*(1-j)^n*C(k, j)/k!), 0<=k<=n.at n=60A247493
- a(n) = Sum{k=0..n} (-1)^(n-k)*binomial(n, k)*Stirling2(n, k).at n=8A343841
- Numbers that are the sum of eight fourth powers in eight or more ways.at n=13A345583
- Numbers that are the sum of eight fourth powers in exactly eight ways.at n=11A345840