10,114,432
27 × 31 × 2549
Abundant
Even
Composite
10,114,432 factors as 2^7 × 31 × 2549. Its 32 positive divisors give a proper-divisor sum of 10,693,568, so this integer is abundant. The Collatz stopping time is 145 steps.
Prime Factor Structure
Factorization String
2^7 × 31 × 2549
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
20,808,000
Proper Divisor Sum
10,693,568
Digit Sum / Digital Root
16 (Root: 7)
Radix Representation
| Decimal | 10114432 |
| Binary | 100110100101010110000000 (24 bits) |
| Octal | 0o46452600 |
| Hexadecimal | 0x9A5580 |
Divisor Catalog (32)
Collatz Trajectory (145 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.