8882
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13326
- Proper Divisor Sum (Aliquot Sum)
- 4444
- 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
- 4440
- Möbius Function
- 1
- Radical
- 8882
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers that are the sum of 11 positive 7th powers.at n=43A003378
- Numbers k such that the continued fraction for sqrt(k) has period 9.at n=45A010339
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (1, p(1), p(2), ...).at n=21A024460
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (primes).at n=20A024468
- Numbers having three 8's in base 10.at n=26A043523
- Internal digits of n^2 include digits of n as subsequence.at n=32A046834
- Internal digits of n^2 include digits of n as subsequence, n does not end in 0.at n=2A046835
- Becomes prime after exactly 7 iterations of f(x) = sum of prime factors of x.at n=10A047826
- a(n) = T(n, n-5), array T as in A055818.at n=10A055822
- Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = 0 or +- 1.at n=18A063867
- Numbers k such that 10*k-1, 10*k-3, 10*k-7 and 10*k-9 are all prime.at n=34A064975
- Numbers m such that [A070080(m), A070081(m), A070082(m)] is an acute scalene integer triangle with prime side lengths.at n=22A070123
- First occurrence of exactly n 0's in the binary expansion of sqrt(2).at n=11A084187
- Near-repdigit semiprimes with 8 as repeated digit.at n=8A105989
- Positions of 4's in A038800 with offset 1.at n=35A115095
- Semiprimes (A001358) whose digit reversal is a powerful(1) number (A001694).at n=29A115688
- Least power of 3 having exactly n consecutive 9's in its decimal representation.at n=6A131544
- Numbers k such that k and k^2 use only the digits 2, 4, 7, 8 and 9.at n=19A137107
- a(n) = Sum_{k <= n/2 } k*binomial(n-2k, 3k+1).at n=18A137360
- Numbers k such that |2^k-993| is prime.at n=22A165779