1,028,040
23 × 3 × 5 × 13 × 659
Abundant
Even
Composite
1,028,040 factors as 2^3 × 3 × 5 × 13 × 659. Its 64 positive divisors give a proper-divisor sum of 2,298,360, so this integer is abundant. The Collatz stopping time is 240 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3 × 5 × 13 × 659
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
3,326,400
Proper Divisor Sum
2,298,360
Digit Sum / Digital Root
15 (Root: 6)
Adjacent Primes
#1028029 ← → #1028047
Radix Representation
| Decimal | 1028040 |
| Binary | 11111010111111001000 (20 bits) |
| Octal | 0o3727710 |
| Hexadecimal | 0xFAFC8 |
Divisor Catalog (5 of 64)
Collatz Trajectory (240 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.