1,579,578
2 × 3 × 7 × 11 × 13 × 263
Abundant
Even
Composite
1,579,578 factors as 2 × 3 × 7 × 11 × 13 × 263. Its 64 positive divisors give a proper-divisor sum of 2,678,214, so this integer is abundant. The Collatz stopping time is 194 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 7 × 11 × 13 × 263
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
4,257,792
Proper Divisor Sum
2,678,214
Digit Sum / Digital Root
42 (Root: 6)
Adjacent Primes
#1579561 ← → #1579579
Radix Representation
| Decimal | 1579578 |
| Binary | 110000001101000111010 (21 bits) |
| Octal | 0o6015072 |
| Hexadecimal | 0x181A3A |
Divisor Catalog (5 of 64)
Collatz Trajectory (194 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.