4800
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 42
- Divisor Sum
- 15748
- Proper Divisor Sum (Aliquot Sum)
- 10948
- 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
- 1280
- Möbius Function
- 0
- Radical
- 30
- Omega Function (Ω)
- 9
- 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
- 20
- 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
- Glaisher's function U(n).at n=7A002612
- Values of phi(k) when phi(k) = phi(k+1).at n=17A003275
- Theta series of D_5 lattice.at n=30A005930
- a(1) = 2, a(n) = sigma(a(n-1)).at n=11A007497
- a(n) = floor(n*(n - 1)*(n - 2)/31).at n=54A011913
- Place n distinguishable balls in n boxes (in n^n ways); let f(n,k) = number of ways that max in any box is k, for 1<=k<=n; sequence gives triangle of numbers f(n,k)/n.at n=16A019576
- Place n distinguishable balls in n boxes (in n^n ways); let f(n,k) = number of ways that max in any box is k, for 1<=k<=n; sequence gives f(n,2)/n.at n=5A019577
- Number of similarity classes of descendants created by bisection refinement from an initial n-simplex.at n=3A019999
- Number of sets S = {a_1, a_2, ..., a_k}, with 1 < a_i < a_j <= n such that no a_j divides the product of all the others.at n=19A023995
- Number of partitions of n in which the least part is odd.at n=29A026804
- Expansion of 1/((1-3x)(1-5x)(1-6x)(1-10x)).at n=3A028056
- Expansion of (theta_3(z)*theta_3(11z) + theta_2(z)*theta_2(11z))^3.at n=42A028611
- Theta series of 8-d 6-modular lattice G_2 tensor F_4 (or A_2 tensor D_4) with det 1296 and minimal norm 4 in powers of q^2.at n=9A028977
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 25 (most significant digit on left).at n=46A029470
- Theta series of 8-dimensional strongly 6-modular lattice O(6) with minimal norm 3.at n=23A029720
- Average theta series of odd unimodular lattices of dimension 10 (multiplied by 5).at n=3A029812
- Low temperature series for spin-1/2 Ising specific heat on 2D square lattice, multiplied by 4.at n=3A029873
- 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 33.at n=25A031531
- a(n) = 3*n^2.at n=40A033428
- Multiplicity of highest weight (or singular) vectors associated with character chi_52 of Monster module.at n=34A034440