17291
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17292
- 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
- 17290
- Möbius Function
- -1
- Radical
- 17291
- 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
- 97
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1987
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/5.at n=44A001135
- Number of commutative semigroups of order n.at n=7A001426
- Coordination sequence for sigma-CrFe, Position Xd.at n=33A009959
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-12).at n=22A023442
- Smallest prime with "n^2" as central digit(s).at n=27A038370
- Primes resulting from procedure described in A048393.at n=22A048394
- Values of A (the short leg) of a Pythagorean triangle with A and C (the hypotenuse) both prime and part of a twin prime.at n=30A051642
- Primes of the form p^2 + p - 1 when p is prime.at n=14A053185
- Primes congruent to 3 modulo 4 generated recursively: a(n) = Min_{p, prime; p mod 4 = 3; p|4Q-1}, where Q is the product of all previous terms in the sequence. The initial term is 3.at n=3A057205
- a(n) = 4*a(n-1)*a(n-2)*a(n-3) - a(n-4) with a(1) = a(2) = a(3) = a(4) = 1.at n=7A072878
- Generalized Markoff numbers: union of numbers a, b, c, d satisfying the Markoff(4) equation a^2 + b^2 + c^2 + d^2 = 4*a*b*c*d.at n=12A075276
- Smallest prime with "n^3" as central digit(s).at n=9A084430
- Sequence of the primes P = p(k)^2 + p(k) - 1 such that P and P + 2 are twin primes where p(k) denotes k-th prime.at n=7A088484
- Primes p of the form k*(k + 1) - 1 such that p and p + 2 are twin primes.at n=17A088486
- "Secondary twin primes": a(n) = A006450(A096477(n)).at n=41A096479
- Primes A005382(n) + A005384(n) - 1 with a twin prime A005382(n) + A005384(n) + 1.at n=24A099109
- Smallest prime of the form (prime(n)*prime(n+1)+q)/2 for some integer n and some prime q.at n=40A100557
- Smallest prime equal to the sum of exactly 2n+1 distinct odd primes.at n=42A100694
- Primes p such that the polynomial x^5-x^4-x^3-x^2-x-1 mod p has 5 distinct zeros.at n=13A106281
- a(1) = a(2) = a(3) = 1; for n > 1, a(n+3) = a(n)^2 + a(n+1)^2 + a(n+2)^2.at n=6A112957