17712
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 52080
- Proper Divisor Sum (Aliquot Sum)
- 34368
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5760
- Möbius Function
- 0
- Radical
- 246
- Omega Function (Ω)
- 8
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 141
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = Fibonacci(n) + 1.at n=22A001611
- Theta series of E_6 lattice.at n=15A004007
- Theta series of {E_6}* lattice.at n=45A005129
- a(n) = Fibonacci(n) + (-1)^n.at n=22A008346
- a(n+1) = a(n) - F(n) if > 0, otherwise a(n) + F(n), where F() are Fibonacci numbers; a(0) = 0.at n=22A011369
- Pisot sequences L(4,6), E(4,6).at n=18A020706
- Pisot sequences L(6,9), E(6,9).at n=17A020717
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Fibonacci numbers), t = A023533.at n=55A024466
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = A000045, t = A023533.at n=54A025086
- Theta series of extremal 3-modular even lattice in dimension 18.at n=3A034619
- Pisot sequence L(3,4).at n=19A048577
- Expansion of (2-6*x+4*x^2-x^3)/((1-x)*(1-3*x+x^2)).at n=11A052925
- a(n) = 3*a(n-1) - a(n-2) - 1 with a(0) = 1 and a(1) = 2.at n=11A055588
- Numbers that are Fibonacci numbers plus or minus 1.at n=39A061489
- a(n) = Fibonacci(4n+2) + 1, or Fibonacci(2n+2)*Lucas(2n).at n=5A081004
- Smallest nonsquarefree integer > the n-th term of the Fibonacci sequence.at n=21A114555
- a(n) = F(n+1) + (1-(-1)^n)/2, where F() = Fibonacci numbers A000045.at n=21A127968
- a(n) = F(n)*L(n-2) where F = Fibonacci and L = Lucas numbers.at n=12A128535
- A090801(2n-1)+A090801(2n).at n=39A140958
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (0, 0, -1), (0, 1, -1), (1, 0, -1), (1, 1, 0)}.at n=10A148439