2200
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 4
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 5580
- Proper Divisor Sum (Aliquot Sum)
- 3380
- 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
- 800
- Möbius Function
- 0
- Radical
- 110
- 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
- 94
- 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
- 5th power of rooted tree enumerator; number of linear forests of 5 rooted trees.at n=6A000343
- 4-dimensional figurate numbers: a(n) = n*binomial(n+2, 3).at n=9A002417
- Squares written in base 7.at n=27A002440
- Expansion of (1-x)^(-3) * (1-x^2)^(-2).at n=18A002624
- High temperature series for spin-1/2 Ising surface susceptibility on f.c.c. lattice.at n=2A003491
- Stern's sequence: a(1) = 1, a(n+1) is the sum of the m preceding terms, where m*(m-1)/2 < n <= m*(m+1)/2 or equivalently m = ceiling((sqrt(8*n+1)-1)/2) = A002024(n).at n=13A005230
- Numbers n such that n! has a square number of digits.at n=37A006488
- a(n) = Sum_{k=1..n-1} lcm(k,n-k).at n=25A006580
- Coordination sequence T2 for Zeolite Code AFS.at n=36A008024
- Coordination sequence T2 for Zeolite Code BPH.at n=36A008056
- Coordination sequence T3 for Zeolite Code LOV.at n=31A008136
- Coordination sequence T1 for Zeolite Code ATO.at n=31A008265
- a(n) = n OR n^3 (applied to ternary expansions).at n=12A008469
- Expansion of e.g.f.: exp(tanh(x)).x.at n=8A009263
- Coordination sequence T3 for Zeolite Code RTE.at n=32A009892
- a(n) = floor( n*(n-1)*(n-2)/23 ).at n=38A011905
- arctan(sinh(x)*arctan(x))=2/2!*x^2-4/4!*x^4-130/6!*x^6+2200/8!*x^8...at n=4A012558
- tanh(sinh(x)*arctan(x))=2/2!*x^2-4/4!*x^4-130/6!*x^6+2200/8!*x^8...at n=3A012561
- Representation of n in base of Catalan numbers (a classic greedy version).at n=38A014418
- G.f.: (1+x)*(1+x^3)*(1+x^5)*(1+x^7)*(1+x^9)/((1-x^2)*(1-x^4)*(1-x^6)*(1-x^8)*(1-x^10)).at n=47A014670