4,702,008
23 × 3 × 107 × 1831
Abundant
Even
Composite
4,702,008 factors as 2^3 × 3 × 107 × 1831. Its 32 positive divisors give a proper-divisor sum of 7,169,352, so this integer is abundant. The Collatz stopping time is 131 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3 × 107 × 1831
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
11,871,360
Proper Divisor Sum
7,169,352
Digit Sum / Digital Root
21 (Root: 3)
Adjacent Primes
#4701971 ← → #4702037
Radix Representation
| Decimal | 4702008 |
| Binary | 10001111011111100111000 (23 bits) |
| Octal | 0o21737470 |
| Hexadecimal | 0x47BF38 |
Divisor Catalog (5 of 32)
Collatz Trajectory (131 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.