16993
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16994
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16992
- Möbius Function
- -1
- Radical
- 16993
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 84
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1960
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- First term of strong prime quintets: p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2) > p(m+4)-p(m+3).at n=39A054808
- Primes p such that x^59 = 2 has no solution mod p.at n=34A059312
- Base 4 expansion of 1/n has equal percentage of each digit 0,1,2,3.at n=19A074709
- Base 4 expansion of 1/n has equal percentage of each digit 0,1,2,3 (primitive values of n only).at n=17A074900
- Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.at n=20A089473
- Partial sums of A000219.at n=15A091360
- Primes p = p_(n+1) such that p_n + p_(n+2) = 2*p_(n+1) + 12.at n=13A095673
- Larger prime in pair prime(k) +/- k for some k.at n=25A107637
- New factors appearing in the factorization of 7^k - 2^k as k increases.at n=37A109254
- Numbers k with the property that k followed by k 7's is prime.at n=10A133127
- Primes of the form x^2 + 1848*y^2.at n=46A139668
- Primes of the form 57x^2+18xy+193y^2.at n=30A140631
- Primes congruent to 33 mod 53.at n=37A142563
- Primes congruent to 35 mod 61.at n=34A142833
- Primes p such that p+p^2+p^3-+2 are also prime.at n=29A154821
- Primes p such that 2*p^3-+15 are also prime.at n=23A174364
- Primes congruent to 1 mod 59.at n=35A216315
- Primes p such that p + 4, p + 16, p + 64, p + 256 and p + 1024 are all semiprimes.at n=15A241493
- Number of partitions of n such that (number parts having multiplicity 1) is a part and (number of parts > 1) is not a part.at n=40A241513
- Number of (n+1)X(4+1) 0..2 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=1A250990