19,210,000
24 × 54 × 17 × 113
Abundant
Even
Composite
19,210,000 factors as 2^4 × 5^4 × 17 × 113. Its 100 positive divisors give a proper-divisor sum of 30,470,972, so this integer is abundant. The Collatz stopping time is 239 steps.
Prime Factor Structure
Factorization String
2^4 × 5^4 × 17 × 113
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
100
Divisor Sum (σ)
49,680,972
Proper Divisor Sum
30,470,972
Digit Sum / Digital Root
13 (Root: 4)
Radix Representation
| Decimal | 19210000 |
| Binary | 1001001010001111100010000 (25 bits) |
| Octal | 0o111217420 |
| Hexadecimal | 0x1251F10 |
Divisor Catalog (60 of 100)
Collatz Trajectory (239 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.