10947
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15120
- Proper Divisor Sum (Aliquot Sum)
- 4173
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7040
- Möbius Function
- -1
- Radical
- 10947
- 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
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = Fibonacci(n) + 1.at n=21A001611
- Fibonacci(n) - (-1)^n.at n=20A007492
- Pisot sequences L(4,6), E(4,6).at n=17A020706
- Pisot sequences L(6,9), E(6,9).at n=16A020717
- a(n) = n*(13*n + 1)/2.at n=41A022271
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = A000201 (lower Wythoff sequence).at n=35A025118
- One of four 3rd-order recurring sequences for which the first derived sequence and the Galois transformed sequence coincide.at n=11A032908
- Trajectory of 3 under map n->31n+1 if n odd, n->n/2 if n even.at n=12A037113
- Pisot sequence L(3,4).at n=18A048577
- a(2n) = a(2n-1)+a(2n-2), a(2n+1) = a(2n)+a(2n-1)-1, a(0)=2, a(1)=1.at n=20A052959
- Numbers that are Fibonacci numbers plus or minus 1.at n=37A061489
- Cyclotomic polynomials Phi_n at x=phi, ceiled up (where phi = tau = (sqrt(5)+1)/2).at n=44A063707
- Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and ceiled up (where phi = tau = (sqrt(5)+1)/2).at n=46A063708
- a(n) = Fibonacci(n+1)+cos(n*Pi/2).at n=20A074662
- Starting with a(0) = 1, smallest number k > a(n-1) such that, for all a(m) with m < n, k + a(m) is not squarefree.at n=12A080793
- a(n) = Fibonacci(4n+1) + 1, or Fibonacci(2n+1)*Lucas(2n).at n=5A081003
- Numbers k such that 11*13^k + 2 is prime.at n=15A084074
- Numbers n such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3 are consecutive primes, where p(i) denotes the i-th prime.at n=15A088066
- a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum_{i = 1..n} (a(i) - a(1)).at n=11A093467
- a(n) = 1 + Fibonacci(n) - (Fibonacci(n) mod 2).at n=21A104220