16673
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16674
- 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
- 16672
- Möbius Function
- -1
- Radical
- 16673
- 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
- 159
- 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
- 1929
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- (Presumed) solution to Waring's problem: g(n) = 2^n + floor((3/2)^n) - 2.at n=13A002804
- Palindromic primes in base 3.at n=23A029971
- Least term in period of continued fraction for sqrt(n) is 8.at n=37A031432
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 15.at n=9A031603
- Primes p with the following property: let d_1, d_2, ... be the distinct digits occurring in the decimal expansion of p. Then for each d_i, dropping all the digits d_i from p produces a prime number. Leading 0's are not allowed.at n=43A057876
- Primes with 4 distinct digits that remain prime (no leading zeros allowed) after deleting all occurrences of its digits d.at n=2A057880
- Primes p such that x^16 = 2 has no solution mod p, but x^8 = 2 has a solution mod p.at n=36A059287
- Primes p such that x^48 = 2 has no solution mod p, but x^24 = 2 has a solution mod p.at n=25A059669
- Binomial transform of A064413.at n=11A065971
- The first of two consecutive primes with equal digital sums.at n=39A066540
- Primes p such that x^8 = 2 has a solution mod p, but x^(8^2) = 2 has no solution mod p.at n=42A070184
- Primes which remain prime after one and after two applications of the rotate-and-add operation of A086002.at n=8A086003
- Primes produced by repeated application of the formula p -> (10p +- 3) starting at the prime 2.at n=12A086322
- Records in A034694.at n=21A120856
- Largest prime < 10*a(n-1), a(1)=17.at n=3A124299
- Records in A066674.at n=18A125879
- Beastly fax numbers: numbers containing the fax number of the Beast (667, one more than its regular number) in their decimal expansion.at n=30A138563
- The smallest prime p that makes the pair p+/-6n both primes while no other pair of p+/-6k+6*n, 0<k<n both primes.at n=58A139602
- Primes congruent to 32 mod 43.at n=40A142281
- Primes congruent to 35 mod 47.at n=39A142386