9,767,056
24 × 13 × 46957
Abundant
Even
Composite
9,767,056 factors as 2^4 × 13 × 46957. Its 20 positive divisors give a proper-divisor sum of 10,612,716, so this integer is abundant. The Collatz stopping time is 238 steps.
Prime Factor Structure
Factorization String
2^4 × 13 × 46957
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
20
Divisor Sum (σ)
20,379,772
Proper Divisor Sum
10,612,716
Digit Sum / Digital Root
40 (Root: 4)
Radix Representation
| Decimal | 9767056 |
| Binary | 100101010000100010010000 (24 bits) |
| Octal | 0o45204220 |
| Hexadecimal | 0x950890 |
Divisor Catalog (20)
Collatz Trajectory (238 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.