16989
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
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 8931
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9696
- Möbius Function
- -1
- Radical
- 16989
- 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
- 35
- 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
- Numbers k such that k and k^2 use only the digits 1, 2, 6, 8 and 9.at n=10A137016
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 5,0,0,0,0,1,0 for x=0,1,2,3,4,5,6.at n=4A205080
- Expansion of x^4*(1-x-x^2)/((1+x)*(1-2*x)*(1-x-2*x^2)).at n=17A219754
- Number of non-equivalent (mod D_4) binary n X n matrices with 4 pairwise nonadjacent 1's.at n=5A239576
- Number of integers m, 1 <= m <= A002569(n), that are not terms in the triangle T(n,k) of A008284.at n=49A292994
- Number of multisets of exactly seven nonempty binary words with a total of n letters such that no word has a majority of 0's.at n=9A316408
- Numbers k such that A000110(k) is divisible by k.at n=4A325630