1,686,294

2 × 3² × 93683

1,686,294 factors as 2 × 3^2 × 93683. Its 12 positive divisors give a proper-divisor sum of 1,967,382, so this integer is abundant. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 93683

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 3,653,676

Proper Divisor Sum 1,967,382

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #1686287 ← → #1686319

Radix Representation

Decimal	1686294
Binary	110011011101100010110 (21 bits)
Octal	0o6335426
Hexadecimal	0x19BB16

Divisor Catalog (12)

1 2 3 6 9 18 93,683 187,366 281,049 562,098 843,147 1,686,294

Collatz Trajectory (132 steps to reach 1)

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

1,686,294 843,147 2,529,442 1,264,721 3,794,164 1,897,082 948,541 2,845,624 1,422,812 711,406 355,703 1,067,110 533,555 1,600,666 800,333 2,401,000 1,200,500 600,250 300,125 900,376 450,188 225,094 112,547 337,642 168,821 506,464 253,232 126,616 63,308 31,654 15,827 47,482 23,741 71,224 35,612 17,806 8,903 26,710 13,355 40,066 20,033 60,100 30,050 15,025 45,076 22,538 11,269 33,808 16,904 8,452 4,226 2,113 6,340 3,170 1,585 4,756 2,378 1,189 3,568 1,784

← Previous Integer #1,686,293 Browse Full Index Next Integer #1,686,295 →