4,702,890
2 × 3 × 5 × 59 × 2657
Abundant
Even
Composite
4,702,890 factors as 2 × 3 × 5 × 59 × 2657. Its 32 positive divisors give a proper-divisor sum of 6,779,670, so this integer is abundant. The Collatz stopping time is 193 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 5 × 59 × 2657
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
11,482,560
Proper Divisor Sum
6,779,670
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#4702889 ← → #4702903
Radix Representation
| Decimal | 4702890 |
| Binary | 10001111100001010101010 (23 bits) |
| Octal | 0o21741252 |
| Hexadecimal | 0x47C2AA |
Divisor Catalog (5 of 32)
Collatz Trajectory (193 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.