9,130,746
2 × 3 × 1521791
Abundant
Even
Composite
9,130,746 factors as 2 × 3 × 1521791. Its 8 positive divisors give a proper-divisor sum of 9,130,758, so this integer is abundant. The Collatz stopping time is 225 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 1521791
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
8
Divisor Sum (σ)
18,261,504
Proper Divisor Sum
9,130,758
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#9130733 ← → #9130757
Radix Representation
| Decimal | 9130746 |
| Binary | 100010110101001011111010 (24 bits) |
| Octal | 0o42651372 |
| Hexadecimal | 0x8B52FA |
Divisor Catalog (5 of 8)
Collatz Trajectory (225 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.