9,109,746
2 × 34 × 53 × 1061
Abundant
Even
Composite
9,109,746 factors as 2 × 3^4 × 53 × 1061. Its 40 positive divisors give a proper-divisor sum of 11,707,578, so this integer is abundant. The Collatz stopping time is 132 steps.
Prime Factor Structure
Factorization String
2 × 3^4 × 53 × 1061
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
40
Divisor Sum (σ)
20,817,324
Proper Divisor Sum
11,707,578
Digit Sum / Digital Root
36 (Root: 9)
Radix Representation
| Decimal | 9109746 |
| Binary | 100010110000000011110010 (24 bits) |
| Octal | 0o42600362 |
| Hexadecimal | 0x8B00F2 |
Divisor Catalog (40)
Collatz Trajectory (132 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
More profiles
Browse other published profiles and their separate link collections.
No other profiles in this collection.