8870
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15984
- Proper Divisor Sum (Aliquot Sum)
- 7114
- 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
- 3544
- Möbius Function
- -1
- Radical
- 8870
- 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
- 78
- 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
- a(n) = ceiling((n + 7/10)^3).at n=19A034133
- Values of A038007 not ending in 6 or 8.at n=12A038009
- Numbers whose base-5 representation contains exactly two 0's and three 4's.at n=22A045213
- Number of partitions of n into odious numbers (A000069).at n=52A067590
- Numbers k such that average of prime(k) and prime(k+1) is a perfect square.at n=37A076692
- Antidiagonal sums of square table A089447, which lists the coefficients of x^n*y^k in f(x,y) that satisfies: f(x,y) = g(x,y) + xy*f(x,y)^4 and where g(x,y) satisfies: 1 + (x+y-1)*g(x,y) + xy*g(x,y)^2 = 0.at n=7A089449
- a(0)=0. a(n) = a(n-1) + (sum of positive integers which are coprime to n, <= n and missing from {a(0),a(1),a(2),..,a(n-1)}).at n=46A122847
- Numbers k such that k and k^2 use only the digits 0, 6, 7, 8 and 9.at n=2A136966
- 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, 0), (-1, 0, 0), (-1, 1, -1), (0, 1, 1), (1, -1, -1)}.at n=10A148215
- G.f. satisfies: A(x) = x + 2*A(x)^2 + 3*A(x)*A(A(x))^2 + 4*A(x)*A(A(x))*A(A(A(x)))^2 +...at n=5A153304
- a(n) = (2*n^3 + 5*n^2 - 13*n)/2.at n=19A162262
- n-th prime*8-7 is the square of a prime.at n=35A169583
- Number of permutations of 3 copies of 1..n with no element e[i>=2]<e[1+floor((i-2)/4)] (4-way heap).at n=3A178019
- Number of isomorphism classes of nanocones with 3 pentagons and a symmetric boundary of length n.at n=42A197988
- Numbers n such that 7^n - 8 is prime.at n=13A217131
- Number of binary Lyndon words of length n having a conjugate at Hamming distance 2.at n=38A226893
- Related to Pisano periods: numbers n such that there are n+10 distinct Fibonacci numbers mod n.at n=27A229467
- a(n) = Sum_{i=0..n} digsum_9(i)^4, where digsum_9(i) = A053830(i).at n=11A231687
- The number of P-positions in the game of Nim with up to four piles, allowing for piles of zero, such that the total number of objects in all piles doesn't exceed 2n.at n=27A237686
- Number of length 5+2 0..n arrays with every three consecutive terms having the sum of some two elements equal to twice the third.at n=16A248438