9,709,566
2 × 3 × 1618261
Abundant
Even
Composite
9,709,566 factors as 2 × 3 × 1618261. Its 8 positive divisors give a proper-divisor sum of 9,709,578, so this integer is abundant. The Collatz stopping time is 269 steps.
Prime Factor Structure
Factorization String
2 × 3 × 1618261
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
8
Divisor Sum (σ)
19,419,144
Proper Divisor Sum
9,709,578
Digit Sum / Digital Root
42 (Root: 6)
Radix Representation
| Decimal | 9709566 |
| Binary | 100101000010011111111110 (24 bits) |
| Octal | 0o45023776 |
| Hexadecimal | 0x9427FE |
Divisor Catalog (8)
Collatz Trajectory (269 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.