4,835,022
2 × 3 × 109 × 7393
Abundant
Even
Composite
4,835,022 factors as 2 × 3 × 109 × 7393. Its 16 positive divisors give a proper-divisor sum of 4,925,058, so this integer is abundant. The Collatz stopping time is 206 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 109 × 7393
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
9,760,080
Proper Divisor Sum
4,925,058
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#4835011 ← → #4835023
Radix Representation
| Decimal | 4835022 |
| Binary | 10010011100011011001110 (23 bits) |
| Octal | 0o22343316 |
| Hexadecimal | 0x49C6CE |
Divisor Catalog (5 of 16)
Collatz Trajectory (206 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.