2,998,242
2 × 33 × 13 × 4271
Abundant
Even
Composite
2,998,242 factors as 2 × 3^3 × 13 × 4271. Its 32 positive divisors give a proper-divisor sum of 4,178,718, so this integer is abundant. The Collatz stopping time is 257 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^3 × 13 × 4271
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
7,176,960
Proper Divisor Sum
4,178,718
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#2998241 ← → #2998243
Radix Representation
| Decimal | 2998242 |
| Binary | 1011011011111111100010 (22 bits) |
| Octal | 0o13337742 |
| Hexadecimal | 0x2DBFE2 |
Divisor Catalog (5 of 32)
Collatz Trajectory (257 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.