10,240,128
27 × 33 × 2963
Abundant
Even
Composite
10,240,128 factors as 2^7 × 3^3 × 2963. Its 64 positive divisors give a proper-divisor sum of 19,992,672, so this integer is abundant. The Collatz stopping time is 75 steps.
Prime Factor Structure
Factorization String
2^7 × 3^3 × 2963
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
30,232,800
Proper Divisor Sum
19,992,672
Digit Sum / Digital Root
18 (Root: 9)
Radix Representation
| Decimal | 10240128 |
| Binary | 100111000100000010000000 (24 bits) |
| Octal | 0o47040200 |
| Hexadecimal | 0x9C4080 |
Divisor Catalog (60 of 64)
Collatz Trajectory (75 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.