2952
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 8190
- Proper Divisor Sum (Aliquot Sum)
- 5238
- 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
- 960
- Möbius Function
- 0
- Radical
- 246
- Omega Function (Ω)
- 6
- 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
- 22
- 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
- Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.at n=26A000125
- a(n) = round(n*phi^10), where phi is the golden ratio, A001622.at n=24A004945
- a(n) = ceiling(n*phi^10), where phi is the golden ratio, A001622.at n=24A004965
- Number of primitive (aperiodic, or Lyndon) asymmetric rhythm cycles: ones having no nontrivial shift automorphism.at n=9A006575
- Coordination sequence T2 for Zeolite Code APD.at n=36A008035
- Expansion of 1/((1-8*x)*(1-10*x)).at n=3A016186
- Numbers whose base-3 representation is the juxtaposition of two identical strings.at n=35A020331
- Numbers whose base-9 representation is the juxtaposition of two identical strings.at n=35A020337
- a(n) = n*(23*n + 1)/2.at n=16A022281
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (1, p(1), p(2), ...).at n=48A024369
- In base 11, a(n) = sum of digits of Lucas(a(n)).at n=33A025491
- Sequence A025513 divided by 2.at n=0A025514
- Least term in period of continued fraction for sqrt(n) is 3.at n=43A031427
- Every run of digits of n in base 3 has length 2.at n=14A033001
- Every run of digits of n in base 11 has length 2.at n=23A033009
- Numbers whose base-11 expansion has no run of digits with length < 2.at n=35A033024
- Decimal part of n-th root of a(n) starts with digit 6.at n=15A034083
- Multiplicity of highest weight (or singular) vectors associated with character chi_61 of Monster module.at n=35A034449
- Multiplicity of highest weight (or singular) vectors associated with character chi_63 of Monster module.at n=34A034451
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+5 or 24k-5. Also number of partitions in which no odd part is repeated, with at most 2 parts of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=40A036031