17711
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18000
- Proper Divisor Sum (Aliquot Sum)
- 289
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 17424
- Möbius Function
- 1
- Radical
- 17711
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- yes
- 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
- 79
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).at n=11A001906
- a(n) = 3*a(n-2) - a(n-4), a(0)=0, a(1)=1, a(2)=1, a(3)=4. Alternates Fibonacci (A000045) and Lucas (A000032) sequences for even and odd n.at n=22A005013
- a(n) = Fibonacci(Fibonacci(n+1) + 1).at n=7A005370
- Odd Fibonacci numbers.at n=14A014437
- Pseudoprimes to base 11.at n=36A020139
- Pseudoprimes to base 78.at n=36A020206
- Strong pseudoprimes to base 11.at n=8A020237
- Strong pseudoprimes to base 85.at n=14A020311
- Smallest Fibonacci number beginning with n.at n=17A020345
- Pisot sequence E(2,3).at n=19A020695
- Pisot sequences E(3,5), P(3,5).at n=18A020701
- Pisot sequences E(5,8), P(5,8).at n=17A020712
- Least Fibonacci number ending with n.at n=11A023184
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (F(2), F(3), ...), t = A023533.at n=54A024595
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = (F(2), F(3), F(4), ...), t = A023533.at n=53A025109
- a(n) = Fibonacci(3*n + 1).at n=7A033887
- a(n) = Fibonacci(4*n + 2).at n=5A033890
- Fibonacci numbers with exactly 2 different digits (probably finite).at n=7A034292
- Fibonacci numbers with all odd digits (probably finite).at n=8A034375
- Products of successive Fibonacci numbers.at n=38A034722