4,687,968
25 × 3 × 47 × 1039
Abundant
Even
Composite
4,687,968 factors as 2^5 × 3 × 47 × 1039. Its 48 positive divisors give a proper-divisor sum of 7,891,872, so this integer is abundant. The Collatz stopping time is 74 steps.
Prime Factor Structure
Factorization String
2^5 × 3 × 47 × 1039
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
12,579,840
Proper Divisor Sum
7,891,872
Digit Sum / Digital Root
48 (Root: 3)
Adjacent Primes
#4687967 ← → #4687979
Radix Representation
| Decimal | 4687968 |
| Binary | 10001111000100001100000 (23 bits) |
| Octal | 0o21704140 |
| Hexadecimal | 0x478860 |
Divisor Catalog (48)
Collatz Trajectory (74 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):