16493
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16494
- 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
- 16492
- Möbius Function
- -1
- Radical
- 16493
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 97
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1912
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Largest prime factor of 9^n + 1.at n=7A002592
- a(n) = a(n-1) + a(n-4) with a(0) = 0, a(1) = a(2) = a(3) = 1.at n=33A003269
- Expansion of (1-x)/(1-x-x^4).at n=36A017898
- Numbers k such that the continued fraction for sqrt(k) has period 95.at n=12A020434
- Primes that remain prime through 3 iterations of function f(x) = 4x + 9.at n=40A023282
- Primes that remain prime through 3 iterations of function f(x) = 9x + 2.at n=35A023296
- Primes that remain prime through 4 iterations of function f(x) = 4x + 9.at n=6A023312
- Primes that remain prime through 4 iterations of function f(x) = 9x + 2.at n=13A023324
- Numbers k such that s(k) + s(k+1) + ... + s(k+14) = t(k) + t(k+1) + ... + t(k+14).at n=3A033916
- Expansion of (1-x)*(1+x)/(1-x-2*x^2+x^4).at n=16A052535
- Sequence is its own 4th difference.at n=8A055988
- Largest prime factor of 3^n + 1.at n=14A074476
- Largest prime factor of 3^n - 1.at n=27A074477
- Solution to the non-squashing boxes problem (version 1).at n=36A089054
- Expansion of -x - x^3*(2 -2*x^4 +x^5)/((1-x^2)*(1+x+x^4)).at n=31A089076
- Primes from merging of 5 successive digits in decimal expansion of (Pi^2).at n=16A104928
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 7.at n=36A109561
- Numbers k such that (2*k)!/(2*(k!)^2)+1 is prime.at n=43A112863
- Primes p such that q-p = 26, where q is the next prime after p.at n=8A124594
- List of primitive prime divisors of the numbers (3^k-1)/2 (A003462) for k>=2, in order of their occurrence.at n=37A129733