1560
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
- 32
- Divisor Sum
- 5040
- Proper Divisor Sum (Aliquot Sum)
- 3480
- 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
- 390
- Omega Function (Ω)
- 6
- 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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 122
- 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 6 squares.at n=10A000141
- Powers of rooted tree enumerator.at n=9A000439
- a(n) = 4^n - C(4,3)*3^n + C(4,2)*2^n - C(4,1).at n=5A000919
- a(n) = (7*n+3)*(7*n+5)*(7*n+6).at n=1A001561
- Highly abundant numbers: numbers k such that sigma(k) > sigma(m) for all m < k.at n=48A002093
- Shuffling 2n cards.at n=39A002139
- Oblong (or promic, pronic, or heteromecic) numbers: a(n) = n*(n+1).at n=39A002378
- a(n) = 2*n*(2*n-1).at n=20A002939
- Maximal number of pieces obtained by slicing a torus (or a bagel) with n cuts: (n^3 + 3*n^2 + 8*n)/6 (n > 0).at n=20A003600
- Number of symmetries in planted (1,4) trees on 3n-1 vertices.at n=4A003613
- Define predecessors of n, P(n), to consist of numbers whose binary representation is obtained from that of n by replacing 10 with 01 or changing a final 1 to a 0; then a(0)=1, a(n) = Sum a(P(n)), n>0.at n=51A004065
- Number of n-step walks on square lattice in the first quadrant which finish at distance n-3 from the x-axis.at n=12A005564
- a(1)=1; a(n) = n!*Fibonacci(n+2), n > 1.at n=4A005922
- Generalized Lucas numbers.at n=11A006491
- Coordination sequence T1 for Zeolite Code AEL.at n=26A008004
- Coordination sequence T3 for Zeolite Code AFR.at n=30A008021
- Coordination sequence T1 for Zeolite Code FAU.at n=33A008105
- Coordination sequence T6 for Zeolite Code MTT.at n=24A008194
- Theta series of {D_6}* lattice.at n=20A008425
- Theta series of D_6 lattice.at n=5A008428