17551
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17552
- 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
- 17550
- Möbius Function
- -1
- Radical
- 17551
- 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
- 141
- 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
- 2018
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 88 ones.at n=20A031856
- Primes p such that x^18 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.at n=34A059664
- Primes p such that x^54 = 2 has no solution mod p, but x^6 = 2 has a solution mod p.at n=36A059665
- Primes p such that x^36 = 2 has no solution mod p, but x^12 = 2 has a solution mod p.at n=23A059668
- a(n) = n^3 - n + 1.at n=26A061600
- The last number for which a determinant of base-n numbers is nonzero.at n=24A079505
- a(n) = smallest prime of the form n*(n+1)*(n+2)*...*(n+k) + 1, or 0 if no such prime exists.at n=24A087564
- Smallest prime of the form n*(n+1)*(n+2)...(n+k) + 1, k > 0, i.e., a(n) > n+1, or 0 if no such prime exists.at n=24A089305
- Primes of the form k^2 - 7*k + 7.at n=29A089376
- Smallest prime of the form n(n-1)(n-2)...(n-k)+1, or 0 if no such prime exists.at n=26A092927
- Primes of the form k^3 - k + 1.at n=12A100698
- Numbers such that the digital sums in bases 2, 3, 5 and 7 all are equal.at n=22A135127
- Primes congruent to 28 mod 59.at n=32A142755
- Primes congruent to 44 mod 61.at n=31A142842
- a(n) = 1 + (6 + (11 + (6 + n)*n)*n)*n/24.at n=24A145126
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 00100-00100-11111 pattern in any orientation.at n=12A146998
- a(n) = 78*n^2 + 1.at n=15A158769
- Prime numbers 3*n-2 such that n, 2*n-1 and 3*n-2 are prime.at n=27A180025
- Primes of the form floor( (k*(sqrt(3)*k-1))/sqrt(2) ).at n=18A180449
- Numbers n such that 4n+3 is a palindromic prime.at n=36A193419