9,258,618
2 × 3 × 1543103
Abundant
Even
Composite
9,258,618 factors as 2 × 3 × 1543103. Its 8 positive divisors give a proper-divisor sum of 9,258,630, so this integer is abundant. The Collatz stopping time is 132 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 1543103
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
8
Divisor Sum (σ)
18,517,248
Proper Divisor Sum
9,258,630
Digit Sum / Digital Root
39 (Root: 3)
Adjacent Primes
#9258617 ← → #9258629
Radix Representation
| Decimal | 9258618 |
| Binary | 100011010100011001111010 (24 bits) |
| Octal | 0o43243172 |
| Hexadecimal | 0x8D467A |
Divisor Catalog (5 of 8)
Collatz Trajectory (132 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.