8878
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 31
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13968
- Proper Divisor Sum (Aliquot Sum)
- 5090
- 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
- 4224
- Möbius Function
- -1
- Radical
- 8878
- 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
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers that are the sum of 7 positive 7th powers.at n=27A003374
- Expansion of x*(1+x-x^2)/((1-x)^4*(1+x)).at n=45A005744
- Number of nodes in regular n-gon with all diagonals drawn.at n=22A007569
- Number of intersection points of diagonals of an n-gon in general position, plus number of vertices.at n=23A014626
- Eleven iterations of Reverse and Add are needed to reach a palindrome.at n=28A015992
- a(n) = 1*prime(n) + 2*prime(n-1) + ... + k*prime(n+1-k), where k=floor((n+1)/2) and prime(n) is the n-th prime.at n=29A023870
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (primes).at n=28A024867
- G.f. satisfies A(x) = 1 + x*A(x)^2*A(x^2).at n=9A036675
- Numbers having three 8's in base 10.at n=23A043523
- a(n)^2 is the smallest square containing exactly n 8's.at n=4A048353
- Triangle of number of rises in restricted growth strings (RGS) for the set partitions of n.at n=48A056858
- Numbers which need eleven 'Reverse and Add' steps to reach a palindrome.at n=26A065216
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 7 and 8.at n=12A136864
- Numbers k such that k and k^2 use only the digits 1, 2, 4, 7 and 8.at n=24A136997
- Numbers k such that k and k^2 use only the digits 1, 3, 4, 7 and 8.at n=5A137028
- Numbers k such that k and k^2 use only the digits 1, 4, 5, 7 and 8.at n=7A137049
- Numbers k such that k and k^2 use only the digits 1, 4, 6, 7 and 8.at n=12A137052
- Numbers k such that k and k^2 use only the digits 1, 4, 7 and 8.at n=3A137057
- Numbers k such that k and k^2 use only the digits 1, 4, 7, 8 and 9.at n=9A137058
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, -1, 1), (1, 0, -1), (1, 1, 0)}.at n=8A149266