8580
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 28224
- Proper Divisor Sum (Aliquot Sum)
- 19644
- 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
- 1920
- Möbius Function
- 0
- Radical
- 4290
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 5
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
- 78
- 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
- a(n) = 5*binomial(n, 6).at n=13A000910
- Degrees of irreducible representations of alternating group A_13.at n=42A003868
- Degrees of irreducible representations of symmetric group S_13.at n=73A003877
- Degrees of irreducible representations of symmetric group S_13.at n=75A003877
- Degrees of irreducible representations of symmetric group S_13.at n=74A003877
- Number of nonseparable tree-rooted planar maps with n + 2 edges and 3 vertices.at n=9A006411
- Coordination sequence for A_4 lattice.at n=9A008383
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-1)*a(1) for n >= 4.at n=12A025266
- Even numbers in the (2,3)-Pascal triangle A029600.at n=58A029605
- Even numbers in the (2,3)-Pascal triangle A029600 that are different from 2.at n=44A029607
- Central numbers in the (2,3)-Pascal triangle A029600.at n=7A029609
- Even numbers in (3,2)-Pascal triangle A029618 that are different from 2.at n=45A029625
- a(n) = n*(n + 1)*(n + 2)*(n + 3)/2.at n=10A033486
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique value such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.at n=39A050032
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 2.at n=39A050048
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=39A050064
- Number of partitions of n into distinct parts with 3 levels of parentheses.at n=12A050344
- Partial sums of A051947.at n=7A050483
- Numbers that are divisible by exactly 5 different primes.at n=22A051270
- a(n) = lcm(n, phi(n), n - phi(n)).at n=32A052100