1,026,366
2 × 3 × 11 × 15551
Abundant
Even
Composite
1,026,366 factors as 2 × 3 × 11 × 15551. Its 16 positive divisors give a proper-divisor sum of 1,213,122, so this integer is abundant. The Collatz stopping time is 121 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 11 × 15551
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
2,239,488
Proper Divisor Sum
1,213,122
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#1026359 ← → #1026371
Radix Representation
| Decimal | 1026366 |
| Binary | 11111010100100111110 (20 bits) |
| Octal | 0o3724476 |
| Hexadecimal | 0xFA93E |
Divisor Catalog (5 of 16)
Collatz Trajectory (121 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.