1120
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
- 3024
- Proper Divisor Sum (Aliquot Sum)
- 1904
- 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
- 384
- Möbius Function
- 0
- Radical
- 70
- Omega Function (Ω)
- 7
- 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
- 18
- 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
- Number of ways of writing n as a sum of 5 squares.at n=21A000132
- Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)Pi*n^(3/2), P(n) = A(n) - V(n); A000092 gives values of n where |P(n)| sets a new record; sequence gives (nearest integer to, I believe) P(A000092(n)).at n=34A000223
- Expansion of Product (1 - x^k)^8 in powers of x.at n=44A000731
- Number of compositions of n into 4 ordered relatively prime parts.at n=17A000742
- No-3-in-line problem on n X n grid: total number of ways of placing 2n points on n X n grid so no 3 are in a line. No symmetries are taken into account.at n=10A000755
- a(n) = n*(n+3)*2^(n-3).at n=6A001793
- Related to Zarankiewicz's problem.at n=45A001841
- Almost trivalent maps.at n=1A002009
- Almost trivalent maps.at n=3A002012
- Generalized sum of divisors function.at n=27A002132
- Denominators of coefficients in asymptotic expansion of (2/Pi)*Integral_{0..oo} (sin x / x)^n dx.at n=2A002305
- Coefficients of Chebyshev polynomials: n*(2*n-3)*2^(2*n-5).at n=3A002698
- Rotatable partitions.at n=31A002722
- Apéry numbers: a(n) = n^2*C(2n,n).at n=4A002736
- Figure 8's with 2n edges on the square lattice.at n=4A003305
- Numbers that are the sum of 4 positive 5th powers.at n=18A003349
- a(n) = 2^(n-4)*C(n,4).at n=4A003472
- Triangle of coefficients of Euler polynomials 2^n*E_n(x) (exponents in increasing order).at n=32A004174
- Triangle of coefficients of Euler polynomials 2^n*E_n(x) (exponents in decreasing order).at n=31A004175
- Numbers that are the sum of at most 4 positive 5th powers.at n=44A004844