8,850,738
2 × 3 × 13 × 233 × 487
Abundant
Even
Composite
8,850,738 factors as 2 × 3 × 13 × 233 × 487. Its 32 positive divisors give a proper-divisor sum of 10,333,518, so this integer is abundant. The Collatz stopping time is 119 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 13 × 233 × 487
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
19,184,256
Proper Divisor Sum
10,333,518
Digit Sum / Digital Root
39 (Root: 3)
Adjacent Primes
#8850671 ← → #8850773
Radix Representation
| Decimal | 8850738 |
| Binary | 100001110000110100110010 (24 bits) |
| Octal | 0o41606462 |
| Hexadecimal | 0x870D32 |
Divisor Catalog (5 of 32)
Collatz Trajectory (119 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.