4,057,872
24 × 3 × 7 × 13 × 929
Abundant
Even
Composite
4,057,872 factors as 2^4 × 3 × 7 × 13 × 929. Its 80 positive divisors give a proper-divisor sum of 8,857,968, so this integer is abundant. The Collatz stopping time is 66 steps.
Resources
Prime Factor Structure
Factorization String
2^4 × 3 × 7 × 13 × 929
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
80
Divisor Sum (σ)
12,915,840
Proper Divisor Sum
8,857,968
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#4057871 ← → #4057873
Radix Representation
| Decimal | 4057872 |
| Binary | 1111011110101100010000 (22 bits) |
| Octal | 0o17365420 |
| Hexadecimal | 0x3DEB10 |
Divisor Catalog (5 of 80)
Collatz Trajectory (66 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.