17011
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17012
- 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
- 17010
- Möbius Function
- -1
- Radical
- 17011
- 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
- 84
- 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
- 1961
- 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 92 ones.at n=6A031860
- Base-5 digits are, in order, the first n terms of the periodic sequence with initial period 1,0,2.at n=6A037498
- Discriminants of imaginary quadratic fields with class number 19 (negated).at n=31A046016
- Second term of strong prime 5-tuples: p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2).at n=39A054809
- Primes of the form 210n + 1.at n=37A073102
- Suppose p and q = p+22 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 51 possible difference patterns, shown in the Comments line. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.at n=49A079021
- a(n) = number of distinct values of Product_{i=1..r} x_i!*i!^x_i, where (x_1, ..., x_r) is an r-tuple of nonnegative integers with Sum_{i=1..r} i*x_i = n.at n=47A102465
- a(1)=1, and recursively a(n+1) is the smallest prime p of the form p = 2*a(n) + 5^k for some k>0.at n=8A113927
- Primes for which the level is equal to 9 in A117563.at n=39A118481
- Primes of the form p = prime(k) = (prime(k+3)+prime(k-1))/2.at n=16A126238
- Numbers such that the digital sums in bases 2, 3, 5 and 7 all are equal.at n=19A135127
- Primes congruent to 44 mod 47.at n=37A142395
- Primes congruent to 51 mod 53.at n=39A142581
- Primes congruent to 19 mod 59.at n=35A142746
- Primes congruent to 53 mod 61.at n=32A142851
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 3X3 tee 1,1 1,2 1,3 2,2 3,2 in any orientation.at n=10A146009
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 3X3 tee 1,1 1,2 1,3 2,2 3,2 in any orientation.at n=23A146011
- Cyclops emirps.at n=20A183057
- Primes having only {0, 1, 7} as digits.at n=25A199327
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210859; see the Formula section.at n=50A210858