17231
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17232
- 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
- 17230
- Möbius Function
- -1
- Radical
- 17231
- 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
- 79
- 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
- 1984
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Coordination sequence for sigma-CrFe, Position Xb.at n=33A009960
- a(n) = 11*a(n-1) + 7*a(n-2).at n=5A015601
- Primes that remain prime through 3 iterations of function f(x) = 4x + 3.at n=40A023281
- Primes that remain prime through 4 iterations of function f(x) = 4x + 3.at n=11A023311
- Primes that remain prime through 5 iterations of function f(x) = 4x + 3.at n=2A023339
- Denominators of continued fraction convergents to sqrt(666).at n=10A042281
- a(n) = A072637(A048679(n)).at n=34A072647
- Initial prime of the first prime chain of length n under the iteration x -> 4x + 3.at n=6A084957
- Initial prime of the first prime chain of length n under the iteration x -> 4x + 3.at n=7A084957
- Upper prime of a difference of 22 between consecutive primes.at n=31A098976
- Round(1000*x), where x is the solution to x = 5^(n-x).at n=19A104744
- a(n) = a(n-2) + a(n-3) + a(n-4) + a(n-5) + a(n-6) + a(n-7).at n=25A109538
- 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=41A139602
- Primes congruent to 6 mod 53.at n=33A142536
- Primes congruent to 3 mod 59.at n=33A142730
- Primes congruent to 29 mod 61.at n=39A142827
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/10.at n=26A152310
- Consecutive pairs of prime point sums in A161191 (includes triples).at n=32A161192
- a(n) is the smallest prime of the form 4k + 3 such that the first n iterations of the map p -> 4p + 3 are prime with the next iteration being composite.at n=7A179767
- Primes p such that f(f(p)) is prime, where f(x) = x^4 + x^3 + x^2 + x + 1 = A053699(x).at n=17A237445