17497
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17498
- 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
- 17496
- Möbius Function
- -1
- Radical
- 17497
- 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
- 2014
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Class 1- (or Pierpont) primes: primes of the form 2^t*3^u + 1.at n=27A005109
- Primes that remain prime through 3 iterations of function f(x) = 4x + 3.at n=41A023281
- Primes that remain prime through 4 iterations of function f(x) = 4x + 3.at n=12A023311
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 86 ones.at n=14A031854
- Primes with multiplicative persistence value 5.at n=37A046505
- Prime factors of numbers in A006521 (numbers k that divide 2^k + 1).at n=7A057719
- Primes p such that p and p^2 have same digit sum.at n=28A058370
- Primes of form 1+(2^a)*(3^b), a>0, b>0.at n=22A058383
- a(n) = smallest k such that 4k has a digit sum = n.at n=39A077490
- Primes of the form m*rad(m)+1, where rad = A007947 (squarefree kernel).at n=40A078324
- Primes p of the form 2*prime(k) + 3 such that 2*prime(k+1) + 3 is the next prime after p.at n=34A089528
- Primes of the form 6*k^2 + 1.at n=16A090687
- Numbers n such that sigma(n) = 2n - 3*phi(phi(n)).at n=23A110074
- Start with 1 and repeatedly reverse the digits and add 74 to get the next term.at n=45A118225
- Triangular array read by rows: T(n,1) = T(n,n) = 1, T(n,k) = 3*T(n-1,k-1) + 2*T(n-1,k).at n=42A119725
- Minimal number m such that Sum_digits(n*m)=n.at n=39A131382
- Primes that divide 2^(3^n)+1 for some n.at n=4A136474
- Least prime p of the form c*3^n+1 with c not divisible by 3.at n=7A137990
- Primes congruent to 7 mod 53.at n=38A142537
- Primes congruent to 33 mod 59.at n=35A142760