9,506,706
2 × 3 × 11 × 17 × 37 × 229
Abundant
Even
Composite
9,506,706 factors as 2 × 3 × 11 × 17 × 37 × 229. Its 64 positive divisors give a proper-divisor sum of 13,147,374, so this integer is abundant. The Collatz stopping time is 150 steps.
Prime Factor Structure
Factorization String
2 × 3 × 11 × 17 × 37 × 229
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
22,654,080
Proper Divisor Sum
13,147,374
Digit Sum / Digital Root
33 (Root: 6)
Radix Representation
| Decimal | 9506706 |
| Binary | 100100010000111110010010 (24 bits) |
| Octal | 0o44207622 |
| Hexadecimal | 0x910F92 |
Divisor Catalog (60 of 64)
Collatz Trajectory (150 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.