57,246,750
2 × 34 × 53 × 11 × 257
Abundant
Even
Composite
57,246,750 factors as 2 × 3^4 × 5^3 × 11 × 257. Its 160 positive divisors give a proper-divisor sum of 118,073,538, so this integer is abundant. The Collatz stopping time is 269 steps.
Prime Factor Structure
Factorization String
2 × 3^4 × 5^3 × 11 × 257
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
160
Divisor Sum (σ)
175,320,288
Proper Divisor Sum
118,073,538
Digit Sum / Digital Root
36 (Root: 9)
Radix Representation
| Decimal | 57246750 |
| Binary | 11011010011000010000011110 (26 bits) |
| Octal | 0o332302036 |
| Hexadecimal | 0x369841E |
Divisor Catalog (60 of 160)
Collatz Trajectory (269 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.