8966
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13452
- Proper Divisor Sum (Aliquot Sum)
- 4486
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4482
- Möbius Function
- 1
- Radical
- 8966
- 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
- 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
- 47
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 90.at n=17A020429
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 94.at n=9A031592
- Numbers k such that the simple continued fraction for (1+1/k)^k contains k.at n=50A071527
- Coefficients of the A-Dyson Mod 27 identity.at n=33A104501
- Semiprimes in A056105.at n=22A113519
- Number of rooted trees with total weight n, where the weight of a node at height k is k (with the root considered to be at level 0).at n=31A117356
- Recursion based on Exp[Pi/4]: a(n)=Floor[a(n-1)*Exp[Pi/4]] Angular domain {0,Pi/4} is the smallest self-similar piece of a sine wave.at n=13A136671
- Number of 2-sided strip polyrects with n cells.at n=12A151527
- Partial sums of A053872.at n=9A155974
- Number of partitions of n containing a clique of size 7.at n=39A183564
- a(n) is the conjectured highest power of n which has no four identical digits in succession.at n=14A216065
- Numbers k whose decimal expansion can be split into at least two parts whose binary equivalents can be concatenated (in the same order) to form the binary expansion of the original number k.at n=10A237041
- Numbers that are representable in at least two ways as sums of four distinct nonvanishing squares.at n=38A259058
- Ulam numbers k such that 4*k and 16*k are also Ulam numbers.at n=12A287634
- Solution of the complementary equation a(n) = 2*a(n-2) + b(n-2), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=21A295998
- a(n) = Sum_{k=3..n} binomial(k-1,2) * floor(n/k).at n=36A366970
- G.f.: Sum_{k>=0} x^(k*(k+1)/2) / Product_{j=1..k} (1 - x^(2*j))^2.at n=48A376625
- E.g.f. satisfies A(x) = (1+x)^2 * exp(x * A(x) / (1+x)).at n=5A378047