2250
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 6084
- Proper Divisor Sum (Aliquot Sum)
- 3834
- 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
- 600
- Möbius Function
- 0
- Radical
- 30
- 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
- 45
- 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
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of necklaces with n beads of 2 colors, allowing turning over (these are also called bracelets).at n=16A000029
- Number of ways of writing n as a sum of 5 squares.at n=36A000132
- A generalized partition function.at n=12A002602
- Theta series of D_5 lattice.at n=18A005930
- Coordination sequence T1 for Zeolite Code MFI.at n=30A008161
- Coefficients in expansion of sqrt(2) as Sum_{n>=1} a(n)/(n*n!*(n+1)!), as found by greedy algorithm.at n=52A011193
- Expansion of 1/((1-x)^3*(1-x^3)^2).at n=22A011779
- a(n+1) (n >= 1) is smallest number > a(n) which is the sum of cubes of distinct earlier terms.at n=46A019511
- Place n distinguishable balls in n boxes (in n^n ways); let T(n,k) = number of ways that the maximum in any box is k, for 1 <= k <= n; sequence gives triangle of numbers T(n,k).at n=18A019575
- Numbers whose base-7 representation is the juxtaposition of two identical strings.at n=44A020335
- a(n) = ((5+sqrt(5))/2)^n + ((5-sqrt(5))/2)^n.at n=6A020876
- Place where n-th 1 occurs in A023123.at n=40A022785
- Index of 8^n within the sequence of the numbers of the form 3^i*8^j (A025615).at n=48A025728
- Number of partitions of n into an even number of parts, the least being 3; also, a(n+3) = number of partitions of n into an odd number of parts, each >=3.at n=48A027195
- Triangle whose (n,k)-th entry is 15^(n-k)*binomial(n,k).at n=18A027467
- a(n) = 225*(n-1)*(n-2)/2.at n=3A027470
- a(n) = n*(n+5).at n=45A028557
- Theta series of 6-dimensional 11-modular even lattice of minimal norm 4.at n=25A029586
- Theta series of 6-dimensional extremal 5-modular lattice Q6(4)^{+2}.at n=36A029721
- Numbers whose base-5 representation has 3 more 0's than 4's.at n=38A031473