17431
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17432
- 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
- 17430
- Möbius Function
- -1
- Radical
- 17431
- 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
- 141
- 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
- 2005
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 82 ones.at n=20A031850
- Recursive prime generating sequence.at n=54A039726
- Primes of form 210*p + 1 where p is a prime.at n=14A051648
- Primes p such that p-12, p and p+12 are consecutive primes.at n=12A053072
- Primes of the form k^2 + 7.at n=35A079138
- a(1) = 2, a(n+1) = smallest prime of the form a(n) + k*prime(n+1), k >1.at n=34A085041
- a(1) = 3; for n > 1 a(n) is the least prime of form a(n-1) + k*prime(n-1) with k > 0.at n=35A095184
- Binomial transform of Euler's totient function phi(n+1).at n=12A131045
- Primes congruent to 47 mod 53.at n=40A142577
- Primes congruent to 26 mod 59.at n=30A142753
- Primes congruent to 46 mod 61.at n=34A142844
- Primes in A005891 = Centered pentagonal numbers: (5n^2 + 5n + 2)/2.at n=14A145838
- Primes p such that p*floor(p/2) - 4 and p*floor(p/2) + 4 are prime numbers.at n=25A164622
- Smallest prime greater than n*(n+1)^2/2.at n=32A181956
- First of a run of 4 or more consecutive primes which all equal 1 (mod 3).at n=36A185942
- Primes of the form 9n^2 + 7.at n=12A201707
- Numbers k such that 3^(m+3) == 9 (mod m) where m = (k-1)^2 - 1.at n=45A212912
- First primes beginning a chain of 4 primes indexed equidistantly (n-th, (n+b)-th, (n+2b)-th, (n+3b)-th primes) whose sum of squares is the square of two times a prime and with b <= n.at n=16A214265
- Smallest prime that can be expressed as the sum of n distinct positive squares with the largest square as small as possible.at n=34A224498
- G.f.: 1/(1 - x*(1-x^5)/(1 - x^2*(1-x^6)/(1 - x^3*(1-x^7)/(1 - x^4*(1-x^8)/(1 - x^5*(1-x^9)/(1 - ...)))))), a continued fraction.at n=21A227374