4,784,382
2 × 32 × 131 × 2029
Abundant
Even
Composite
4,784,382 factors as 2 × 3^2 × 131 × 2029. Its 24 positive divisors give a proper-divisor sum of 5,666,058, so this integer is abundant. The Collatz stopping time is 193 steps.
Prime Factor Structure
Factorization String
2 × 3^2 × 131 × 2029
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
24
Divisor Sum (σ)
10,450,440
Proper Divisor Sum
5,666,058
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#4784341 ← → #4784401
Radix Representation
| Decimal | 4784382 |
| Binary | 10010010000000011111110 (23 bits) |
| Octal | 0o22200376 |
| Hexadecimal | 0x4900FE |
Divisor Catalog (24)
Collatz Trajectory (193 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):