3,120,888
23 × 3 × 109 × 1193
Abundant
Even
Composite
3,120,888 factors as 2^3 × 3 × 109 × 1193. Its 32 positive divisors give a proper-divisor sum of 4,759,512, so this integer is abundant. The Collatz stopping time is 133 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3 × 109 × 1193
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
7,880,400
Proper Divisor Sum
4,759,512
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#3120881 ← → #3120889
Radix Representation
| Decimal | 3120888 |
| Binary | 1011111001111011111000 (22 bits) |
| Octal | 0o13717370 |
| Hexadecimal | 0x2F9EF8 |
Divisor Catalog (5 of 32)
Collatz Trajectory (133 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.