4,680,816
24 × 3 × 7 × 13931
Abundant
Even
Composite
4,680,816 factors as 2^4 × 3 × 7 × 13931. Its 40 positive divisors give a proper-divisor sum of 9,139,728, so this integer is abundant. The Collatz stopping time is 100 steps.
Resources
Prime Factor Structure
Factorization String
2^4 × 3 × 7 × 13931
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
40
Divisor Sum (σ)
13,820,544
Proper Divisor Sum
9,139,728
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#4680811 ← → #4680827
Radix Representation
| Decimal | 4680816 |
| Binary | 10001110110110001110000 (23 bits) |
| Octal | 0o21666160 |
| Hexadecimal | 0x476C70 |
Divisor Catalog (5 of 40)
Collatz Trajectory (100 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.