8,839,794
2 × 3 × 1031 × 1429
Abundant
Even
Composite
8,839,794 factors as 2 × 3 × 1031 × 1429. Its 16 positive divisors give a proper-divisor sum of 8,869,326, so this integer is abundant. The Collatz stopping time is 93 steps.
Prime Factor Structure
Factorization String
2 × 3 × 1031 × 1429
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
17,709,120
Proper Divisor Sum
8,869,326
Digit Sum / Digital Root
48 (Root: 3)
Adjacent Primes
#8839783 ← → #8839799
Radix Representation
| Decimal | 8839794 |
| Binary | 100001101110001001110010 (24 bits) |
| Octal | 0o41561162 |
| Hexadecimal | 0x86E272 |
Divisor Catalog (16)
Collatz Trajectory (93 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):