9564
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 22344
- Proper Divisor Sum (Aliquot Sum)
- 12780
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3184
- Möbius Function
- 0
- Radical
- 4782
- Omega Function (Ω)
- 4
- 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
- 122
- 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
- Losing initial positions in game: two players alternate in removing >= 1 stones; last player wins; first player may not remove all stones; each move <= 3 times previous move.at n=27A003411
- Number of acyclic disubstituted alkanes with n carbon atoms and identical substituents.at n=9A005961
- Difference between the number of 5-dimensional partitions of n and an approximation derived from binomial(n,4).at n=10A007328
- Numbers k such that the continued fraction for sqrt(k) has period 68.at n=38A020407
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ] and s = (Fibonacci numbers).at n=15A025078
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (F(2), F(3), F(4), ...).at n=14A025082
- [ (n-1)st elementary symmetric function of {sqrt(k)} ], k = 1,2,...,n.at n=9A025198
- Probable extension of A013704.at n=18A025495
- a(n) = Sum_{k=0..n} (k+1) * A026780(n, n-k).at n=9A027252
- Number of partitions satisfying (cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5)).at n=49A036810
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(3)).at n=49A052477
- Smallest losing position after your opponent has taken k stones in a variation of "Fibonacci Nim".at n=23A054736
- Convolution of Fibonacci F(n+1), n>=0, with F(n+10), n>=0.at n=7A067978
- Triangle read by rows: T(n,k) is number of Dyck paths of semilength n having k ascents of length 1 starting at an even level.at n=69A102404
- Expansion of (1 - x + x^2)/(1 - x - x^4).at n=31A103632
- Numbers k such that (2*k)!/(2*(k!)^2)+1 is prime.at n=39A112863
- Numbers k such that k![7]-1 is prime (where k![7] = A114799(k) = septuple factorial).at n=52A156167
- Antidiagonal sums of A147995 and A163545.at n=21A163484
- 1-sequence of reduction of pentagonal numbers sequence by x^2 -> x+1.at n=9A192146
- Expansion of 1/(1 - x - x^2 + x^3 - x^4 + x^6).at n=28A193146