4,429,810
2 × 5 × 7 × 112 × 523
Abundant
Even
Composite
4,429,810 factors as 2 × 5 × 7 × 11^2 × 523. Its 48 positive divisors give a proper-divisor sum of 5,605,838, so this integer is abundant. The Collatz stopping time is 167 steps.
Resources
Prime Factor Structure
Factorization String
2 × 5 × 7 × 11^2 × 523
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
10,035,648
Proper Divisor Sum
5,605,838
Digit Sum / Digital Root
28 (Root: 1)
Adjacent Primes
#4429801 ← → #4429811
Radix Representation
| Decimal | 4429810 |
| Binary | 10000111001011111110010 (23 bits) |
| Octal | 0o20713762 |
| Hexadecimal | 0x4397F2 |
Divisor Catalog (5 of 48)
Collatz Trajectory (167 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.