1,426,062

2 × 3 × 11 × 17 × 31 × 41

1,426,062 factors as 2 × 3 × 11 × 17 × 31 × 41. Its 64 positive divisors give a proper-divisor sum of 2,057,586, so this integer is abundant. The Collatz stopping time is 124 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 17 × 31 × 41

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 3,483,648

Proper Divisor Sum 2,057,586

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1426057 ← → #1426063

Radix Representation

Decimal	1426062
Binary	101011100001010001110 (21 bits)
Octal	0o5341216
Hexadecimal	0x15C28E

Divisor Catalog (60 of 64)

1 2 3 6 11 17 22 31 33 34 41 51 62 66 82 93 102 123 186 187 246 341 374 451 527 561 682 697 902 1,023 1,054 1,122 1,271 1,353 1,394 1,581 2,046 2,091 2,542 2,706 3,162 3,813 4,182 5,797 7,626 7,667 11,594 13,981 15,334 17,391 21,607 23,001 27,962 34,782 41,943 43,214 46,002 64,821 83,886 129,642

Collatz Trajectory (124 steps to reach 1)

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

1,426,062 713,031 2,139,094 1,069,547 3,208,642 1,604,321 4,812,964 2,406,482 1,203,241 3,609,724 1,804,862 902,431 2,707,294 1,353,647 4,060,942 2,030,471 6,091,414 3,045,707 9,137,122 4,568,561 13,705,684 6,852,842 3,426,421 10,279,264 5,139,632 2,569,816 1,284,908 642,454 321,227 963,682 481,841 1,445,524 722,762 361,381 1,084,144 542,072 271,036 135,518 67,759 203,278 101,639 304,918 152,459 457,378 228,689 686,068 343,034 171,517 514,552 257,276 128,638 64,319 192,958 96,479 289,438 144,719 434,158 217,079 651,238 325,619

← Previous Integer #1,426,061 Browse Full Index Next Integer #1,426,063 →