4,251,918
2 × 3 × 11 × 23 × 2801
Abundant
Even
Composite
4,251,918 factors as 2 × 3 × 11 × 23 × 2801. Its 32 positive divisors give a proper-divisor sum of 5,431,794, so this integer is abundant. The Collatz stopping time is 136 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 11 × 23 × 2801
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
9,683,712
Proper Divisor Sum
5,431,794
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#4251917 ← → #4251931
Radix Representation
| Decimal | 4251918 |
| Binary | 10000001110000100001110 (23 bits) |
| Octal | 0o20160416 |
| Hexadecimal | 0x40E10E |
Divisor Catalog (5 of 32)
Collatz Trajectory (136 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.