17707
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17708
- 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
- 17706
- Möbius Function
- -1
- Radical
- 17707
- 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
- 48
- 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
- 2033
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Euclid-Mullin sequence (A000945) with initial value a(1)=53 instead of a(1)=2.at n=19A051320
- a(n) is the first prime p from A031924 such that A052180(primepi(p)) = prime(n).at n=21A052229
- Numbers k such that 5^k - 4^k is prime.at n=11A059802
- Primes p(x) satisfying the following conditions: (a) A082882(x)=1; (b) {p(x),p(x+1)} are not twin primes; (c) values of A075860(j) for j composites between these two non-twin primes are identical.at n=8A082883
- Larger prime in pair prime(k) +/- k for some k.at n=26A107637
- a(n) = number of conjugacy classes in PSL_4(prime(n)).at n=12A124681
- Primes p such that p - q = 24, where q is the previous prime before p; or prime numbers preceded by precisely 23 composite numbers.at n=28A126720
- Largest prime not exceeding Fibonacci(n) = A000045(n).at n=19A138184
- Primes congruent to 5 mod 53.at n=36A142535
- Primes congruent to 7 mod 59.at n=32A142734
- Primes congruent to 17 mod 61.at n=32A142815
- a(n) = Fibonacci(n) - 4.at n=17A157728
- Primes p such that p1 = ceiling(p/2) + p is prime and p2 = floor(p1/2) + p1 is prime.at n=38A158714
- Primes 4 less than some Fibonacci number.at n=6A163853
- Positions of zeros in A165597.at n=6A165598
- a(n) = Least i in range [A165598(n),A165598(n+1)] for which abs(A165597(i)) gets the maximum value in that range.at n=6A165599
- Right edge of triangular table A138612.at n=35A166019
- Partial sums of the Fermat pseudoprimes to base 2, A001567.at n=10A172255
- Numbers that have 10 terms in their Zeckendorf representation.at n=8A179250
- Largest prime immediately preceding a Fibonacci number.at n=18A180422