8,839,758
2 × 3 × 307 × 4799
Abundant
Even
Composite
8,839,758 factors as 2 × 3 × 307 × 4799. Its 16 positive divisors give a proper-divisor sum of 8,901,042, so this integer is abundant. The Collatz stopping time is 93 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 307 × 4799
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
17,740,800
Proper Divisor Sum
8,901,042
Digit Sum / Digital Root
48 (Root: 3)
Adjacent Primes
#8839757 ← → #8839763
Radix Representation
| Decimal | 8839758 |
| Binary | 100001101110001001001110 (24 bits) |
| Octal | 0o41561116 |
| Hexadecimal | 0x86E24E |
Divisor Catalog (5 of 16)
Collatz Trajectory (93 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
Showing the first 5 trajectory entries; the stopping-time total above is unchanged.