97,046,250
2 × 3 × 54 × 7 × 3697
Abundant
Even
Composite
97,046,250 factors as 2 × 3 × 5^4 × 7 × 3697. Its 80 positive divisors give a proper-divisor sum of 180,214,998, so this integer is abundant. The Collatz stopping time is 262 steps.
Prime Factor Structure
Factorization String
2 × 3 × 5^4 × 7 × 3697
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
80
Divisor Sum (σ)
277,261,248
Proper Divisor Sum
180,214,998
Digit Sum / Digital Root
33 (Root: 6)
Radix Representation
| Decimal | 97046250 |
| Binary | 101110010001100111011101010 (27 bits) |
| Octal | 0o562147352 |
| Hexadecimal | 0x5C8CEEA |
Divisor Catalog (60 of 80)
Collatz Trajectory (262 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.