17093
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17094
- 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
- 17092
- Möbius Function
- -1
- Radical
- 17093
- 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
- 66
- 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
- 1970
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Denominators of continued fraction convergents to sqrt(802).at n=6A042547
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 17.at n=23A050966
- Primes arising in A053782.at n=25A053872
- Expansion of (1+x^4*C)*C^2, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108.at n=9A071743
- Value of C in y = x^2 + 5x + C such that y is prime for all x = 0 to 3.at n=38A097434
- Smallest prime p such that M(n)^2+p*M(n)+1 is prime with M(n)= Mersenne primes =A000668(n).at n=15A139431
- Primes congruent to 27 mod 53.at n=35A142557
- Primes congruent to 42 mod 59.at n=37A142769
- Primes congruent to 13 mod 61.at n=35A142811
- Primes p such that continued fraction of (1 + sqrt(p))/2 has period 17 : primes in A146340.at n=30A146362
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 1001-1111 pattern in any orientation.at n=14A146624
- Primes of the form 2n^2+14n+5.at n=17A154577
- Primes p such that p1=Floor[p/2]+p is prime and p2=Ceiling[p1/2]+p1 is prime.at n=37A158712
- Number of n X n 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,3,0,2,4 for x=0,1,2,3,4.at n=4A196315
- Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,3,0,2,4 for x=0,1,2,3,4.at n=4A196319
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,3,0,2,4 for x=0,1,2,3,4.at n=40A196322
- Primes having primitive roots 2, 3, 5, 7, and 11.at n=32A241046
- Primes having primitive roots 2, 3, 5, 7, 11, and 13.at n=14A241047
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) < number of parts of p.at n=37A241828
- Partial sums of A294016.at n=41A294017