17389
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17390
- 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
- 17388
- Möbius Function
- -1
- Radical
- 17389
- 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
- 185
- 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
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 2000
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Les Marvin sequence: a(n) = F(n) + (n-1)*F(n-1), F() = Fibonacci numbers.at n=16A007502
- Numbers k such that the continued fraction for sqrt(k) has period 99.at n=13A020438
- Fibonacci sequence beginning 1, 17.at n=16A022107
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=33A024600
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=32A025114
- a(n) = prime(100*n).at n=19A031921
- a(n) = prime(1000 * n).at n=1A031922
- Primes p such that p and p^2 have same digit sum.at n=27A058370
- a(n) = 10*n^2 - 6*n + 1.at n=41A087348
- a(n) = 2*a(n-1) + 11*a(n-2) for n > 1, a(0) = a(1) = 1.at n=7A090042
- Let p = prime(sigma(n)) and q = prime(phi(n)), then p is in the sequence if p-q = 6.at n=22A103176
- Smallest prime such that n*k(n)^2+n*k(n)+1 is a prime > (n-1)*k(n-1)^2+(n-1)*k(n-1)+1 with k(n)>1 or 0 if n=4 as no prime possible.at n=22A104995
- Prime sums of 6 positive 5th powers.at n=30A123035
- Primes p of Erdos-Selfridge class 4+ with largest prime factor of p+1 not of class 3+.at n=11A129472
- List of primitive prime divisors of the numbers 4^n-3^n (A005061) in their order of occurrence.at n=31A129737
- Number of degree-2n permutations such that number of cycles of size 2k is odd (or zero) and number of cycles of size 2k-1 is even (or zero), for every k.at n=4A131525
- Mother primes of order 11.at n=26A136070
- Primes congruent to 46 mod 47.at n=39A142397
- Primes congruent to 5 mod 53.at n=35A142535
- Primes congruent to 43 mod 59.at n=37A142770