10,374,832
24 × 13 × 31 × 1609
Abundant
Even
Composite
10,374,832 factors as 2^4 × 13 × 31 × 1609. Its 40 positive divisors give a proper-divisor sum of 11,984,848, so this integer is abundant. The Collatz stopping time is 207 steps.
Prime Factor Structure
Factorization String
2^4 × 13 × 31 × 1609
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
40
Divisor Sum (σ)
22,359,680
Proper Divisor Sum
11,984,848
Digit Sum / Digital Root
28 (Root: 1)
Radix Representation
| Decimal | 10374832 |
| Binary | 100111100100111010110000 (24 bits) |
| Octal | 0o47447260 |
| Hexadecimal | 0x9E4EB0 |
Divisor Catalog (40)
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.