8952
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
- 16
- Divisor Sum
- 22440
- Proper Divisor Sum (Aliquot Sum)
- 13488
- 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
- 2976
- Möbius Function
- 0
- Radical
- 2238
- Omega Function (Ω)
- 5
- 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
- yes
- 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
- McKay-Thompson series of class 35B for Monster.at n=39A058641
- Number of squared primes <= 2^n.at n=33A060967
- Multiples of 24 whose digits also sum to 24.at n=38A066270
- Square array read by antidiagonals: T(n,k)=(T(n,k-1)*n^2-Catalan(k-1))/(n-1) with a(n,1)=1 and a(1,k)=Catalan(k) where Catalan(k)=C(2k,k)/(k+1)=A000108(k).at n=49A067345
- Numbers k such that 2^k mod phi(k) = 2^phi(k) mod k.at n=41A069050
- Expansion of g.f.: (1-4*x*C)/(1-5*x*C) where C = (1/2-1/2*(1-4*x)^(1/2))/x = g.f. for Catalan numbers A000108.at n=6A076026
- Square array read by ascending antidiagonals in which row n has g.f. C/(1-n*x*C) where C = (1/2-1/2*(1-4*x)^(1/2))/x = g.f. for Catalan numbers A000108.at n=60A076038
- Partial sums of A000960.at n=31A099074
- Triangle read by rows: T(n,k) = number of Schroeder (or royal) n-paths (A006318) containing k returns to the diagonal y=x. (A northeast step lying on y=x contributes a return.)at n=30A108891
- A number triangle based on the Catalan numbers.at n=60A110488
- Positive numbers that are not the sum of two squares and a positive Fibonacci number.at n=25A115176
- Record values in A132601.at n=46A132603
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k UUDU's starting at level 0.at n=32A135330
- T(n,k) is the number of order-decreasing and order-preserving partial transformations (of an n-chain) of waist k (waist(alpha) = max(Im(alpha))).at n=42A145035
- Triangle T(n,k), read by rows, given by [0,1,2,1,2,1,2,1,2,1,2,...] DELTA [2,0,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.at n=39A172040
- Numbers k>1 such that phi(phi(k)) = sigma(sopf(k)).at n=36A173337
- Array A(k,n) of the number of points of the A_k lattice with maximum infinity norm n, read by antidiagonals.at n=56A175197
- Triangle read by rows: T(n,k) = number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to k.at n=46A180281
- Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to 2.at n=8A180282
- Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-8.at n=1A180298