9,625,074
2 × 3 × 1604179
Abundant
Even
Composite
9,625,074 factors as 2 × 3 × 1604179. Its 8 positive divisors give a proper-divisor sum of 9,625,086, so this integer is abundant. The Collatz stopping time is 313 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 1604179
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
8
Divisor Sum (σ)
19,250,160
Proper Divisor Sum
9,625,086
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#9625051 ← → #9625081
Radix Representation
| Decimal | 9625074 |
| Binary | 100100101101110111110010 (24 bits) |
| Octal | 0o44556762 |
| Hexadecimal | 0x92DDF2 |
Divisor Catalog (5 of 8)
Collatz Trajectory (313 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.