10946
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
- 8
- Divisor Sum
- 17724
- Proper Divisor Sum (Aliquot Sum)
- 6778
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5040
- Möbius Function
- -1
- Radical
- 10946
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 161
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = 3*a(n-1) - a(n-2) for n >= 2, with a(0) = a(1) = 1.at n=11A001519
- Markoff (or Markov) numbers: union of positive integers x, y, z satisfying x^2 + y^2 + z^2 = 3*x*y*z.at n=21A002559
- Fully multiplicative with a(prime(k)) = Fibonacci(k+2).at n=66A003965
- a(n) = 3*a(n-2) - a(n-4), a(0)=2, a(1)=1, a(2)=3, a(3)=2. Alternates Lucas (A000032) and Fibonacci (A000045) sequences for even and odd n.at n=21A005247
- a(n) = F(F(n)), where F is a Fibonacci number.at n=8A007570
- a(0) = 1, a(n) = 19*n^2 + 2 for n>0.at n=24A010009
- Duplicate of A001519.at n=11A011783
- Even Fibonacci numbers; or, Fibonacci(3*n).at n=7A014445
- Smallest Fibonacci number beginning with n.at n=10A020345
- Pisot sequence E(2,3).at n=18A020695
- Pisot sequences E(3,5), P(3,5).at n=17A020701
- Pisot sequences E(5,8), P(5,8).at n=16A020712
- Least Fibonacci number ending with n.at n=6A023184
- 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=54A024466
- 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=53A024595
- 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=53A025086
- 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=52A025109
- a(n) = Fibonacci(4*n + 1).at n=5A033889
- Products of successive Fibonacci numbers.at n=36A034722
- Values of k for which there are no empty intervals when fractional part(m*phi) for m = 1, ..., k is plotted along [ 0, 1 ] subdivided into k equal regions.at n=23A036415