1,119,840
25 × 3 × 5 × 2333
Abundant
Even
Composite
1,119,840 factors as 2^5 × 3 × 5 × 2333. Its 48 positive divisors give a proper-divisor sum of 2,409,168, so this integer is abundant. The Collatz stopping time is 85 steps.
Resources
Prime Factor Structure
Factorization String
2^5 × 3 × 5 × 2333
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
3,529,008
Proper Divisor Sum
2,409,168
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#1119823 ← → #1119857
Radix Representation
| Decimal | 1119840 |
| Binary | 100010001011001100000 (21 bits) |
| Octal | 0o4213140 |
| Hexadecimal | 0x111660 |
Divisor Catalog (5 of 48)
Collatz Trajectory (85 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.