16998
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 33
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 34008
- Proper Divisor Sum (Aliquot Sum)
- 17010
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5664
- Möbius Function
- -1
- Radical
- 16998
- 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
- 128
- 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
- Expansion of (1+4x-sqrt(1+4x^2))/(4+6x) in powers of x.at n=23A086990
- A Chebyshev transform of 2^n.at n=22A090412
- Triangle T(n, k) = f(n, k) + f(n, n-k) where T(0, 0) = 1 and f(n, k) = 1/(n+1)*Sum_{j=0..k+1} (-1)^(k-j+1)* binomial(n+1, j)*j^n, read by rows.at n=22A155908
- Triangle T(n, k) = f(n, k) + f(n, n-k) where T(0, 0) = 1 and f(n, k) = 1/(n+1)*Sum_{j=0..k+1} (-1)^(k-j+1)* binomial(n+1, j)*j^n, read by rows.at n=26A155908
- Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having a sum of two or less, with rows and columns of the latter in lexicographically nondecreasing order.at n=22A227259
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 441", based on the 5-celled von Neumann neighborhood.at n=27A272223
- Partial sums of A299274.at n=29A299275
- a(0) = 1; a(n) = (11*n^2 - 9*n + 4)/2 for n>0.at n=56A389625