17713
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
- 17714
- 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
- 17712
- Möbius Function
- -1
- Radical
- 17713
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 110
- 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
- 2034
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Next prime after n-th Fibonacci number.at n=22A014208
- Pisot sequence L(4,5).at n=19A018910
- Pisot sequence L(7,10).at n=17A020743
- a(n) = Sum_{k=0..n} T(n,k) * T(n,2n-k), with T given by A027023.at n=8A027041
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 15.at n=11A031603
- Recursive prime generating sequence.at n=55A039726
- Sizes of successive balls in D_4 lattice.at n=42A046949
- Pisot sequence L(5,7).at n=18A048584
- Recip transform of 2*(1 + x^4)-1/(1-x).at n=8A049152
- Expansion of (1-x)/(1-2*x^2-x^3).at n=24A078024
- a(1)=1, a(2)=1 and for n > 2, a(n) is the smallest positive integer such that the third-order absolute difference gives the Fibonacci numbers A000045 = {1,1,2,3,5,8,...}.at n=21A086651
- a(1)=1, a(2)=1 and for n > 2, a(n) is the smallest positive integer such that the third-order absolute difference gives the Fibonacci numbers A000045 = {1,1,2,3,5,8,...}.at n=22A086651
- Primes p such that p's set of distinct digits is {1,3,7}.at n=19A108382
- Smallest squarefree integer > the n-th term of the Fibonacci sequence.at n=22A111077
- Partial sums of (-1)^n*Fibonacci(n-1).at n=24A112469
- Primes of the form (Fibonacci[n+3] + 2) = A018910[n], Pisot sequence L(4,5).at n=4A121605
- Smallest prime >= n-th Fibonacci number.at n=22A138185
- Primes congruent to 11 mod 53.at n=40A142541
- Primes congruent to 13 mod 59.at n=37A142740
- Primes congruent to 23 mod 61.at n=34A142821