2,252,562
2 × 3 × 13 × 28879
Abundant
Even
Composite
2,252,562 factors as 2 × 3 × 13 × 28879. Its 16 positive divisors give a proper-divisor sum of 2,599,278, so this integer is abundant. The Collatz stopping time is 254 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 13 × 28879
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
4,851,840
Proper Divisor Sum
2,599,278
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#2252557 ← → #2252567
Radix Representation
| Decimal | 2252562 |
| Binary | 1000100101111100010010 (22 bits) |
| Octal | 0o10457422 |
| Hexadecimal | 0x225F12 |
Divisor Catalog (5 of 16)
Collatz Trajectory (254 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.