8877
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12960
- Proper Divisor Sum (Aliquot Sum)
- 4083
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5360
- Möbius Function
- -1
- Radical
- 8877
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 96
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers that are the sum of 6 positive 7th powers.at n=23A003373
- Number of atoms in a decahedron with n shells.at n=22A004068
- Molien series for alternating group Alt_12 (or A_12).at n=34A008635
- Number of partitions of n into at most 12 parts.at n=34A008641
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k=[ (n+1)/2 ], s = (natural numbers >= 2), t = (natural numbers >= 3).at n=43A024306
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor(n/2).at n=43A024868
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = floor( n/2 ), s = natural numbers >= 2, t = natural numbers >= 3.at n=42A024869
- Let Do(n) = A006566(n) = n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k>0, with Do(i) = Do(j) + Do(k), ordered by increasing i; sequence gives i values.at n=4A053017
- Triangle T(n,k) of number of strongly connected digraphs on n unlabeled nodes and with k arcs, k=0..n*(n-1).at n=67A057276
- a(1) = 7; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=45A074343
- Antidiagonal sums in A101321.at n=21A101338
- Numbers n such that 6*10^n + 7*R_n + 2 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=9A103043
- Odd interprimes divisible by 11.at n=43A126230
- Ramanujan numbers (A000594) read mod 23^3.at n=23A126847
- Quotients A134245(n)/A134244(n).at n=7A134246
- This sequence and A139143 are complements. a(1) = 1, A139143(1) = 2, a(n+1) = a(n) + Sum_{k = 1..n} A139143(k).at n=34A139142
- a(n) = n*(8*n+5).at n=33A139277
- a(n) = (n^4 + 46*n^3 - 169*n^2 + 146*n + 24)/24.at n=14A143059
- Numbers n such that n^3 - 4 and n^3 + 4 are prime.at n=34A161589
- Number of nX4 binary matrices with no initial bit string in any row or column divisible by 6.at n=6A181038