16983
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
- 16
- Divisor Sum
- 27360
- Proper Divisor Sum (Aliquot Sum)
- 10377
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10368
- Möbius Function
- 0
- Radical
- 1887
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 110
- Smith Number
- yes
- 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
- Number of 4-line partitions of n (i.e., planar partitions of n with at most 4 lines).at n=18A002799
- One seventh of deca-factorial numbers.at n=3A035276
- Number of (unordered) ways of making change for n cents using coins of 1/2, 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage denominations up to 100 cents).at n=45A067997
- Number of binary words of length n containing at least one subword 1000001 and no subwords 10^{i}1 with i<5.at n=39A143285
- a(n) = n^3 - 3*(n+3)^2.at n=27A153260
- G.f. satisfies: A(x) = x^3 - x + Series_Reversion(x - x*A(x)).at n=12A212919
- Numbers n that divide the sum of digits of 36^n.at n=40A220364
- The greater of the lexicographically least pair (x, y) such that 0 < x < y and sigma(x) = sigma(y) = n + x + y.at n=17A285890
- Number of n X 3 0..1 arrays with each 1 horizontally or vertically adjacent to 1 or 4 1s.at n=8A295115
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 1 or 4 1s.at n=57A295120