17351
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17352
- 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
- 17350
- Möbius Function
- -1
- Radical
- 17351
- 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
- 128
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1995
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = floor(t^n) where t = 39661481813^(1/10) (approximately 11.4772).at n=4A076357
- Primes in which the digit string can be partitioned into three parts such that third (least significant) part is the product of the first two.at n=13A088294
- Number of permutations of length n which avoid the patterns 1342, 3214, 4213.at n=9A116768
- Prime numbers p of the form p=x^2+y^3 such that there exist three other prime numbers q,r,s such q=abs(x^2-y^3) ; r=x^3+y^2 ; s=abs(x^3-y^2); x > y.at n=9A129537
- Primes congruent to 20 mod 53.at n=35A142550
- Primes congruent to 5 mod 59.at n=37A142732
- Primes congruent to 27 mod 61.at n=34A142825
- Indices of pentagonal pyramidal numbers which are the sum of two other such numbers: k such that A002411(k) = A002411(i)+A002411(j) for some i,j>0.at n=31A172437
- G.f.: A(x) = Sum_{n>=0} x^n*A(x)^(n*2^n/2).at n=7A177401
- Least positive x in the Diophantine equation x^3 + y^3 = n*z^3 (with x >= y and y != 0).at n=35A190356
- Number of compound perfect squared squares of order n up to symmetries of the square.at n=30A217155
- Primes of the form p^2 + q^2 + 21, where p and q are consecutive primes.at n=14A229075
- Fixed points of A245821 and A245822.at n=26A245823
- Primitive prime factors of the cyclotomic polynomial sequence Phi(5,k) in the order in which they occur.at n=29A256153
- Least prime p such that pi(p*n) = prime(q*n) for some prime q, where pi(x) denotes the number of primes not exceeding x.at n=30A260197
- Numerators of upper primes-only best approximates (POBAs) to sqrt(2); see Comments.at n=13A265774
- Primes whose index is divisible by the product of its digits.at n=27A306766
- a(n) is the least exponent k greater than 1 such that prime(n)^k starts and ends in prime(n).at n=40A320775
- Primes prime(k) such that prime(k) + 2*prime(k+1) and prime(k) + 2*prime(k+1) + 4*prime(k+2) are prime.at n=42A337213
- Primes p such that, if b is the sum of digits of p, y = p mod b and x = (p-y)/b, then p-x*y, p+x*y, x+y and x-y are all prime.at n=39A342801