2470
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
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 5040
- Proper Divisor Sum (Aliquot Sum)
- 2570
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 864
- Möbius Function
- 1
- Radical
- 2470
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 133
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + ... + n^2 = n*(n+1)*(2*n+1)/6.at n=19A000330
- Number of NP-equivalence classes of self-dual threshold functions of n or fewer variables; number of majority (i.e., decisive and weighted) games with n players.at n=7A001532
- The coding-theoretic function A(n,4,4).at n=36A001843
- a(n) = 1 + Sum_{i=1..n} (n-i+1)*phi(i).at n=28A005598
- Weighted count of partitions with odd parts.at n=33A005896
- Primitive pseudoperfect numbers.at n=38A006036
- Primitive nondeficient numbers.at n=31A006039
- Number of n-node trees not determined by their spectra.at n=14A006610
- a(n) = binomial(n+3, 3)/4 for odd n, n*(n+2)*(n+4)/24 for even n.at n=37A006918
- Coordination sequence T1 for Zeolite Code GOO.at n=34A008111
- Coordination sequence T3 for Zeolite Code MEL.at n=32A008152
- Coordination sequence T3 for Zeolite Code TON.at n=31A008243
- Molien series of 4-dimensional representation of cyclic group of order 4 over GF(2) (not Cohen-Macaulay).at n=37A008610
- Coordination sequence T4 for Zeolite Code DFO.at n=38A009878
- Coordination sequence for alpha-Mn, Position Mn3.at n=13A009952
- a(n) = floor(n*(n-1)*(n-2)/24).at n=40A011842
- E.g.f.: tan(arctanh(x)*exp(x)).at n=6A012712
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 3.at n=29A013591
- Even square pyramidal numbers.at n=8A015222
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14).at n=36A017845