4,251,522
2 × 3 × 11 × 37 × 1741
Abundant
Even
Composite
4,251,522 factors as 2 × 3 × 11 × 37 × 1741. Its 32 positive divisors give a proper-divisor sum of 5,280,702, so this integer is abundant. The Collatz stopping time is 105 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 11 × 37 × 1741
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
9,532,224
Proper Divisor Sum
5,280,702
Digit Sum / Digital Root
21 (Root: 3)
Adjacent Primes
#4251493 ← → #4251523
Radix Representation
| Decimal | 4251522 |
| Binary | 10000001101111110000010 (23 bits) |
| Octal | 0o20157602 |
| Hexadecimal | 0x40DF82 |
Divisor Catalog (5 of 32)
Collatz Trajectory (105 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
Showing the first 5 trajectory entries; the stopping-time total above is unchanged.