1,137,656
23 × 13 × 10939
Abundant
Even
Composite
1,137,656 factors as 2^3 × 13 × 10939. Its 16 positive divisors give a proper-divisor sum of 1,159,744, so this integer is abundant. The Collatz stopping time is 209 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 13 × 10939
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
2,297,400
Proper Divisor Sum
1,159,744
Digit Sum / Digital Root
29 (Root: 2)
Adjacent Primes
#1137629 ← → #1137659
Radix Representation
| Decimal | 1137656 |
| Binary | 100010101101111111000 (21 bits) |
| Octal | 0o4255770 |
| Hexadecimal | 0x115BF8 |
Divisor Catalog (5 of 16)
Collatz Trajectory (209 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.