2,566,602

2 × 3² × 142589

2,566,602 factors as 2 × 3^2 × 142589. Its 12 positive divisors give a proper-divisor sum of 2,994,408, so this integer is abundant. The Collatz stopping time is 81 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 142589

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 5,561,010

Proper Divisor Sum 2,994,408

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2566601 ← → #2566633

Radix Representation

Decimal	2566602
Binary	1001110010100111001010 (22 bits)
Octal	0o11624712
Hexadecimal	0x2729CA

Divisor Catalog (12)

1 2 3 6 9 18 142,589 285,178 427,767 855,534 1,283,301 2,566,602

Collatz Trajectory (81 steps to reach 1)

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

2,566,602 1,283,301 3,849,904 1,924,952 962,476 481,238 240,619 721,858 360,929 1,082,788 541,394 270,697 812,092 406,046 203,023 609,070 304,535 913,606 456,803 1,370,410 685,205 2,055,616 1,027,808 513,904 256,952 128,476 64,238 32,119 96,358 48,179 144,538 72,269 216,808 108,404 54,202 27,101 81,304 40,652 20,326 10,163 30,490 15,245 45,736 22,868 11,434 5,717 17,152 8,576 4,288 2,144 1,072 536 268 134 67 202 101 304 152 76

← Previous Integer #2,566,601 Browse Full Index Next Integer #2,566,603 →