4,424,442
2 × 3 × 11 × 43 × 1559
Abundant
Even
Composite
4,424,442 factors as 2 × 3 × 11 × 43 × 1559. Its 32 positive divisors give a proper-divisor sum of 5,459,718, so this integer is abundant. The Collatz stopping time is 118 steps.
Prime Factor Structure
Factorization String
2 × 3 × 11 × 43 × 1559
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
9,884,160
Proper Divisor Sum
5,459,718
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#4424429 ← → #4424447
Radix Representation
| Decimal | 4424442 |
| Binary | 10000111000001011111010 (23 bits) |
| Octal | 0o20701372 |
| Hexadecimal | 0x4382FA |
Divisor Catalog (32)
Collatz Trajectory (118 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):