9954
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 24960
- Proper Divisor Sum (Aliquot Sum)
- 15006
- 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
- 2808
- Möbius Function
- 0
- Radical
- 3318
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 91
- 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
- Powers of rooted tree enumerator.at n=17A000439
- a(n) = [ a(n-1)/a(1) + a(n-3)/a(3) + a(n-5)/a(5) + ... ], for n >= 3.at n=24A022859
- Write cosec x = 1/x + Sum e_n x^(2n-1)/(2n-1)!; sequence gives denominators of e_n.at n=38A036283
- a(n) = floor((4/3)^n).at n=32A064628
- Values of floor((4/3)^n) that are composite.at n=21A070761
- a(1)=3; a(n)=floor((20+sum(a(1) to a(n-1)))/6).at n=53A120180
- Differentiation of A137286: Triangle of coefficients of differentiation recursive orthogonal Hermite polynomials given in Hochstadt's book : P(x, n) = x*P(x, n - 1) - n*P(x, n - 2).at n=61A136209
- Coefficients of Laguerre recursive polynomials with an (n+2)!/2 multiplication factor and alpha=a0 =0 from Hochstadt: P(x, n) = (2*n + a0 + 1 - x)*P(x, n - 1)/(n + 1) - n*P(x, n - 2)/(n + 1);.at n=17A136533
- Coefficients of a special case of Poisson-Charlier polynomials. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=31A137346
- The arithmetic mean of the n-th and (n+1)-st cubes, rounded down.at n=21A147656
- Number of nondecreasing integer sequences of length 18 with sum zero and sum of absolute values 2n.at n=12A158152
- n^3+Smallest square, (Smallest square >= n^3).at n=17A176581
- a(n) counts the distinct cubical (on alphabet of 3 symbols) billiard words with length n, acting as prefix to just k = 2 such words of length n+1 (that is, a subset of "special").at n=15A180438
- Value of z in the Diophantine equation x^3 + y^3 = n*z^3 (with x>0 and minimal and x >= y and y != 0).at n=10A190581
- Numbers a = b + c where a, b, and c contain the same decimal digits.at n=26A203024
- Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 5.at n=44A240014
- Indices of the start of 9 successive distinct digits in the decimal expansion of e (2.718281828...).at n=34A258167
- a(n) = 159*2^n - 222 (n>=1).at n=5A304515
- Number of even parts in the partitions of n into 7 parts.at n=41A309625
- Number of cyclic compositions (necklaces of positive integers) summing to n that have only one part or whose consecutive parts (including the last with first) are indivisible.at n=32A318729