17257
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
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17258
- 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
- 17256
- Möbius Function
- -1
- Radical
- 17257
- 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
- 172
- 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
- 1986
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Incorrect duplicate of A297408.at n=13A007355
- Prime islands: for n >= 2, a(n) = least prime whose adjacent primes are exactly 2n apart; a(1) = 3 by convention.at n=25A046931
- McKay-Thompson series of class 20d for Monster.at n=50A058559
- Class 7- primes.at n=4A081426
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 10.at n=20A109564
- Primes connected to two primes by the (p+1)/2 and 2p-1 operators.at n=39A109835
- Numbers k such that k, k+1, k+2 and k+3 are 1,2,3,4-almost primes.at n=17A113000
- Smallest prime p=prime(k) such that there exist numbers i and j with prime(k-1) < i < p < j < prime(k+1) and gcd(i,j)=n.at n=40A117392
- Numbers appearing in A122072 at least four times.at n=6A122390
- a(n) = T(p(n)) - p(T(n)) = Commutator[triangular numbers, primes] at n.at n=51A123907
- Primes p such that q-p = 34, where q is the next prime after p.at n=5A134116
- Prime numbers, isolated from neighboring primes by >14.at n=27A137874
- Prime numbers, isolated from neighboring primes by >16.at n=14A137875
- Primes of the form x^2 + 1848*y^2.at n=47A139668
- Primes of the form 57x^2+18xy+193y^2.at n=31A140631
- Primes of the form 210k + 37.at n=38A140847
- Primes congruent to 32 mod 53.at n=36A142562
- Primes congruent to 29 mod 59.at n=38A142756
- Primes congruent to 55 mod 61.at n=33A142853
- Primes p such that 8*p^2-2*p-1 divides Fibonacci(p).at n=16A159231