1140
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 3360
- Proper Divisor Sum (Aliquot Sum)
- 2220
- 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
- 288
- Möbius Function
- 0
- Radical
- 570
- Omega Function (Ω)
- 5
- 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
- yes
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 106
- 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
- Tetrahedral (or triangular pyramidal) numbers: a(n) = C(n+2,3) = n*(n+1)*(n+2)/6.at n=18A000292
- Number of graphical basis partitions of 2n.at n=19A001130
- Sum of the first n even squares: a(n) = 2*n*(n+1)*(2*n+1)/3.at n=9A002492
- Smaller of unitary amicable pair.at n=1A002952
- Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (0,1).at n=7A003289
- Number of 2-factors in P_5 X P_2n.at n=2A003776
- Degrees of irreducible representations of Janko group J3.at n=9A003906
- a(n) = binomial coefficient C(2n, n-7).at n=3A004313
- a(n) = C(4n,n-2).at n=3A004332
- Binomial coefficient C(5n,n-1).at n=3A004343
- a(n) = floor(n*phi^9), where phi is the golden ratio, A001622.at n=15A004924
- a(n) = round(n*phi^9), where phi is the golden ratio, A001622.at n=15A004944
- Expansion of (1-x+x^2)/((1-x)^2*(1-x^2)*(1-x^4)).at n=35A005232
- Column of Motzkin triangle.at n=6A005323
- a(n) = a(n-1) + a(n-9) for n >= 9; a(n) = 1 for n=0..7; a(8) = 2.at n=40A005711
- a(n) = Sum_{k=1..n-1} lcm(k,n-k).at n=19A006580
- Numbers k such that sigma(x) = k has exactly 3 solutions.at n=30A007372
- Coordination sequence T5 for Zeolite Code BOG.at n=24A008053
- Coordination sequence T2 for Zeolite Code NAT.at n=23A008204
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^4)).at n=34A008804