1,070,826

2 × 3 × 317 × 563

1,070,826 factors as 2 × 3 × 317 × 563. Its 16 positive divisors give a proper-divisor sum of 1,081,398, so this integer is abundant. The Collatz stopping time is 72 steps.

Prime Factor Structure

Factorization String 2 × 3 × 317 × 563

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 2,152,224

Proper Divisor Sum 1,081,398

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #1070803 ← → #1070827

Radix Representation

Decimal	1070826
Binary	100000101011011101010 (21 bits)
Octal	0o4053352
Hexadecimal	0x1056EA

Divisor Catalog (16)

1 2 3 6 317 563 634 951 1,126 1,689 1,902 3,378 178,471 356,942 535,413 1,070,826

Collatz Trajectory (72 steps to reach 1)

Iterative sequence n → n/2 (if even) or 3n+1 (if odd):

1,070,826 535,413 1,606,240 803,120 401,560 200,780 100,390 50,195 150,586 75,293 225,880 112,940 56,470 28,235 84,706 42,353 127,060 63,530 31,765 95,296 47,648 23,824 11,912 5,956 2,978 1,489 4,468 2,234 1,117 3,352 1,676 838 419 1,258 629 1,888 944 472 236 118 59 178 89 268 134 67 202 101 304 152 76 38 19 58 29 88 44 22 11 34

← Previous Integer #1,070,825 Browse Full Index Next Integer #1,070,827 →