8700
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 26040
- Proper Divisor Sum (Aliquot Sum)
- 17340
- 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
- 2240
- Möbius Function
- 0
- Radical
- 870
- 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
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- 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
- Theta series of laminated lattice LAMBDA_11^{min}.at n=4A006910
- Coordination sequence for {A_4}* lattice.at n=12A008531
- a(n) is the sum over all floor(k^3/n), k=0 to n inclusive.at n=31A014818
- Perimeters of more than one primitive Pythagorean triangle.at n=11A024408
- a(n) = Sum_{k=0..n} (k+1) * A026626(n,k).at n=10A026965
- Maximal number of pairs of minimal vectors in n-dimensional laminated lattice.at n=20A028924
- Triangle T(n,k) (n >= 1, 0<=k<=n) giving number of preferential arrangements of n things beginning with k (transposed, then read by rows).at n=24A054255
- Numbers n such that phi(n+1) = 3*phi(n).at n=28A067143
- Barriers for bigomega(n): numbers n such that, for all m < n, m + bigomega(m) <= n.at n=41A068597
- Triangle read by rows: T(n,k) = number of preferential arrangements of n things where the first object has rank k.at n=24A090665
- Number of reduced tree pairs of n-carets.at n=6A111713
- Numbers n such that Lucas(prime(n)) is prime, where Lucas = A000032.at n=40A120561
- a(n) = 10*n*(n+1).at n=29A163761
- Positions of zeros in A165582.at n=48A165583
- Numbers of the form p^2*q^2*r*s where p, q, r, and s are distinct primes.at n=41A179690
- Accumulation array of A185912, by antidiagonals.at n=74A185913
- Number of zero trace primitive elements in Galois field GF(3^n).at n=9A192212
- a(n) = n*(11*n-5)/2.at n=40A226492
- Number of partitions of n such that 2*(number of distinct parts) = number of parts.at n=46A239959
- Row sums of triangle A027420.at n=39A241944