9,749,490
2 × 3 × 5 × 324983
Abundant
Even
Composite
9,749,490 factors as 2 × 3 × 5 × 324983. Its 16 positive divisors give a proper-divisor sum of 13,649,358, so this integer is abundant. The Collatz stopping time is 150 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 5 × 324983
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
23,398,848
Proper Divisor Sum
13,649,358
Digit Sum / Digital Root
42 (Root: 6)
Adjacent Primes
#9749479 ← → #9749491
Radix Representation
| Decimal | 9749490 |
| Binary | 100101001100001111110010 (24 bits) |
| Octal | 0o45141762 |
| Hexadecimal | 0x94C3F2 |
Divisor Catalog (5 of 16)
Collatz Trajectory (150 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.