9,739,136
27 × 11 × 6917
Abundant
Even
Composite
9,739,136 factors as 2^7 × 11 × 6917. Its 32 positive divisors give a proper-divisor sum of 11,429,944, so this integer is abundant. The Collatz stopping time is 207 steps.
Prime Factor Structure
Factorization String
2^7 × 11 × 6917
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
21,169,080
Proper Divisor Sum
11,429,944
Digit Sum / Digital Root
38 (Root: 2)
Radix Representation
| Decimal | 9739136 |
| Binary | 100101001001101110000000 (24 bits) |
| Octal | 0o45115600 |
| Hexadecimal | 0x949B80 |
Divisor Catalog (32)
Collatz Trajectory (207 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.