2,165,394

2 × 3 × 7 × 11 × 43 × 109

2,165,394 factors as 2 × 3 × 7 × 11 × 43 × 109. Its 64 positive divisors give a proper-divisor sum of 3,410,286, so this integer is abundant. The Collatz stopping time is 210 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 11 × 43 × 109

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 5,575,680

Proper Divisor Sum 3,410,286

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2165393 ← → #2165413

Radix Representation

Decimal	2165394
Binary	1000010000101010010010 (22 bits)
Octal	0o10205222
Hexadecimal	0x210A92

Divisor Catalog (60 of 64)

1 2 3 6 7 11 14 21 22 33 42 43 66 77 86 109 129 154 218 231 258 301 327 462 473 602 654 763 903 946 1,199 1,419 1,526 1,806 2,289 2,398 2,838 3,311 3,597 4,578 4,687 6,622 7,194 8,393 9,374 9,933 14,061 16,786 19,866 25,179 28,122 32,809 50,358 51,557 65,618 98,427 103,114 154,671 196,854 309,342

Collatz Trajectory (210 steps to reach 1)

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

2,165,394 1,082,697 3,248,092 1,624,046 812,023 2,436,070 1,218,035 3,654,106 1,827,053 5,481,160 2,740,580 1,370,290 685,145 2,055,436 1,027,718 513,859 1,541,578 770,789 2,312,368 1,156,184 578,092 289,046 144,523 433,570 216,785 650,356 325,178 162,589 487,768 243,884 121,942 60,971 182,914 91,457 274,372 137,186 68,593 205,780 102,890 51,445 154,336 77,168 38,584 19,292 9,646 4,823 14,470 7,235 21,706 10,853 32,560 16,280 8,140 4,070 2,035 6,106 3,053 9,160 4,580 2,290

← Previous Integer #2,165,393 Browse Full Index Next Integer #2,165,395 →