8889
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 33
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11856
- Proper Divisor Sum (Aliquot Sum)
- 2967
- 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
- 5924
- Möbius Function
- 1
- Radical
- 8889
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 184
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- 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 = (composite numbers).at n=39A024860
- Pair up the numbers.at n=44A030656
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 62.at n=34A031560
- Numbers having three 8's in base 10.at n=32A043523
- Numbers k such that 297*2^k-1 is prime.at n=34A050907
- a(n+1) = a(n)/2 if 2|a(n), a(n)/3 if 3|a(n), a(n)/5 if 5|a(n), a(n)/7 if 7|a(n), a(n)/11 if 11|a(n), a(n)/13 if 13|a(n), otherwise 17*a(n)+1.at n=21A057534
- a(0)=1, a(n) = a(n-1) + 8*10^(n-1).at n=4A059482
- Fourth binomial transform of A010686 (period 2: repeat 1,5).at n=5A080961
- Numbers n such that 30*n+7, 30*n+11, 30*n+13, 30*n+17, 30*n+19 are consecutive primes.at n=13A089157
- "Orders" where balanced prime number records (A082080) occur.at n=50A096692
- Near-repdigit semiprimes with 8 as repeated digit.at n=10A105989
- Numbers k such that the concatenation of 8*k with k gives a square.at n=5A115551
- Triangle read by rows: T(n, k) = Sum_{j=0..n} C(j, k)*C(j, n - k).at n=48A119307
- Triangle read by rows: T(n, k) = Sum_{j=0..n} C(j, k)*C(j, n - k).at n=51A119307
- a(n) = n^4 - n^3 - n^2 - n - 1.at n=10A125082
- First differences of A007088.at n=15A138342
- First differences of A007088.at n=47A138342
- First differences of A007088.at n=79A138342
- Number of binary strings of length n with equal numbers of 00100 and 01110 substrings.at n=14A164239
- G.f.: A(x) = Sum_{n>=0} x^n/(1-x)^(n^2).at n=8A178325