10,244,568
23 × 3 × 23 × 67 × 277
Abundant
Even
Composite
10,244,568 factors as 2^3 × 3 × 23 × 67 × 277. Its 64 positive divisors give a proper-divisor sum of 16,977,192, so this integer is abundant. The Collatz stopping time is 127 steps.
Prime Factor Structure
Factorization String
2^3 × 3 × 23 × 67 × 277
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
27,221,760
Proper Divisor Sum
16,977,192
Digit Sum / Digital Root
30 (Root: 3)
Radix Representation
| Decimal | 10244568 |
| Binary | 100111000101000111011000 (24 bits) |
| Octal | 0o47050730 |
| Hexadecimal | 0x9C51D8 |
Divisor Catalog (60 of 64)
Collatz Trajectory (127 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.