9,730,056
23 × 3 × 7 × 57917
Abundant
Even
Composite
9,730,056 factors as 2^3 × 3 × 7 × 57917. Its 32 positive divisors give a proper-divisor sum of 18,070,584, so this integer is abundant. The Collatz stopping time is 163 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3 × 7 × 57917
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
27,800,640
Proper Divisor Sum
18,070,584
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#9730043 ← → #9730087
Radix Representation
| Decimal | 9730056 |
| Binary | 100101000111100000001000 (24 bits) |
| Octal | 0o45074010 |
| Hexadecimal | 0x947808 |
Divisor Catalog (5 of 32)
Collatz Trajectory (163 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.