2480
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 5952
- Proper Divisor Sum (Aliquot Sum)
- 3472
- 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
- 310
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 89
- 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
- Expansion of 1/((1-x^2)*(1-x^4)^2*(1-x^6)*(1-x^8)*(1-x^10)) (even powers only).at n=29A001994
- Generalized sum of divisors function.at n=39A002130
- Related to representation as sums of squares.at n=16A002292
- Degrees of irreducible representations of Lyons group Ly.at n=1A003917
- Degrees of irreducible representations of Lyons group Ly.at n=2A003917
- Numbers k such that 4!*(2k-5)!/(k!*(k-1)!) is an integer.at n=19A004784
- 5!(2n-6)!/n!(n-1)! is an integer.at n=24A004785
- Expansion of (1+x^2)/((1-x)^2*(1-x^2)^2).at n=29A005993
- a(n) = n*(n+1)*(2*n+1)/3.at n=15A006331
- If n mod 2 = 0 then n*(n^2-4)/12 else n*(n^2-1)/12.at n=31A006584
- Coordination sequence T1 for Zeolite Code APD.at n=33A008034
- Coordination sequence T1 for Zeolite Code EMT.at n=41A008086
- Coordination sequence for Ni2In, Position Ni2.at n=15A009942
- Coordination sequence for FeS2-Marcasite, Fe position.at n=26A009955
- a(n) = floor(n*(n-1)*(n-2)/12).at n=32A011894
- Values of n where (phi(n) * sigma(n))/n is an integer and increases.at n=39A015707
- a(n) = 1*(n) + 2*(n-1) + 3*(n-2) + ... + (n+1-k)*k, where k = floor((n+1)/2).at n=29A023855
- a(n) = 1*(n+1-1) + 2*(n+1-2) + ... + k*(n+1-k), where k = floor((n+1)/2).at n=28A023856
- 5 times triangular numbers: a(n) = 5*n*(n+1)/2.at n=31A028895
- Numbers with 20 divisors.at n=33A030638