2254
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 4104
- Proper Divisor Sum (Aliquot Sum)
- 1850
- 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
- 924
- Möbius Function
- 0
- Radical
- 322
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 138
- 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
- a(n) = (n+1)*(n+3)*(n+8)/6.at n=21A000297
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^7 in powers of x.at n=38A001485
- a(n) = (5*n+1)*(5*n+4).at n=9A001545
- Number of partially achiral planted trees with n nodes.at n=16A003237
- Numbers that are the sum of 7 positive 6th powers.at n=22A003363
- a(n) = round(n*phi^12), where phi is the golden ratio, A001622.at n=7A004947
- a(n) = ceiling(n*phi^12), where phi is the golden ratio, A001622.at n=7A004967
- Mian-Chowla sequence (a B_2 sequence): a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the pairwise sums of elements are all distinct.at n=36A005282
- Coordination sequence T1 for Zeolite Code AFR.at n=36A008019
- Coordination sequence T4 for Zeolite Code EMT.at n=39A008089
- Coordination sequence T2 for Zeolite Code LTN.at n=33A008141
- Coordination sequence T1 for Zeolite Code MEP.at n=28A008157
- Coordination sequence T4 for Zeolite Code MTW.at n=31A008199
- Coordination sequence for Paracelsian.at n=32A008260
- a(n) = floor( n*(n-1)*(n-2)/19 ).at n=36A011901
- Indices of prime Mersenne numbers (A001348).at n=23A016027
- Numbers k such that the continued fraction for sqrt(k) has period 24.at n=39A020363
- a(n) = n*(n+3).at n=46A028552
- 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 46.at n=11A031544
- Multiplicity of highest weight (or singular) vectors associated with character chi_25 of Monster module.at n=34A034413