16417
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16418
- 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
- 16416
- Möbius Function
- -1
- Radical
- 16417
- 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
- 115
- 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
- 1902
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that remain prime through 4 iterations of function f(x) = 3x + 10.at n=14A023310
- Primes that remain prime through 5 iterations of function f(x) = 3x + 10.at n=3A023338
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 66 ones.at n=24A031834
- Numbers n such that n and n+4^k are all primes for k=1,2,3.at n=35A049493
- a(n) and a(n)+4^k are primes at least for k=1,2,3,4.at n=14A049494
- Primes p such that x^16 = 2 has no solution mod p, but x^8 = 2 has a solution mod p.at n=34A059287
- Smallest prime containing n zeros in its binary expansion.at n=12A066195
- Primes p such that x^8 = 2 has a solution mod p, but x^(8^2) = 2 has no solution mod p.at n=40A070184
- Primes of form 2^x + 2^y + 1.at n=29A070739
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6,6]; short d-string notation of pattern = [466].at n=24A078852
- Primes of the form 2^i + 2^j + 1, i > j > 0.at n=25A081091
- Replace 0 with 0000 in binary representation of n.at n=36A084473
- Smallest prime between 2^n and 2^(n+1), having a minimal number of 1's in binary representation.at n=13A091936
- Primes p such that p + 2^2, p + 4^2 and p + 6^2 are also primes.at n=25A092475
- Greatest number having exactly n representations as ab+ac+bc with 0 < a < b < c.at n=15A094377
- E.g.f.: exp(x)/(1-x)^9.at n=4A095740
- Largest prime p such that the sum of n consecutive primes plus p is equal to (n+1)^3.at n=24A100572
- a(n) = a(n-2)+a(n-3)+a(n-4)+a(n-5)+2*a(n-6)+a(n-7).at n=24A109541
- Primes connected to two primes by the (p+1)/2 and 2p-1 operators.at n=38A109835
- Numbers k such that k, k+1, k+2 and k+3 are 1,2,3,4-almost primes.at n=16A113000