6,127,960
23 × 5 × 239 × 641
Abundant
Even
Composite
6,127,960 factors as 2^3 × 5 × 239 × 641. Its 32 positive divisors give a proper-divisor sum of 7,739,240, so this integer is abundant. The Collatz stopping time is 165 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 5 × 239 × 641
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
13,867,200
Proper Divisor Sum
7,739,240
Digit Sum / Digital Root
31 (Root: 4)
Adjacent Primes
#6127949 ← → #6127963
Radix Representation
| Decimal | 6127960 |
| Binary | 10111011000000101011000 (23 bits) |
| Octal | 0o27300530 |
| Hexadecimal | 0x5D8158 |
Divisor Catalog (5 of 32)
Collatz Trajectory (165 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.