2,496,666

2 × 3 × 43 × 9677

2,496,666 factors as 2 × 3 × 43 × 9677. Its 16 positive divisors give a proper-divisor sum of 2,613,318, so this integer is abundant. The Collatz stopping time is 130 steps.

Prime Factor Structure

Factorization String 2 × 3 × 43 × 9677

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 5,109,984

Proper Divisor Sum 2,613,318

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #2496643 ← → #2496667

Radix Representation

Decimal	2496666
Binary	1001100001100010011010 (22 bits)
Octal	0o11414232
Hexadecimal	0x26189A

Divisor Catalog (16)

1 2 3 6 43 86 129 258 9,677 19,354 29,031 58,062 416,111 832,222 1,248,333 2,496,666

Collatz Trajectory (130 steps to reach 1)

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

2,496,666 1,248,333 3,745,000 1,872,500 936,250 468,125 1,404,376 702,188 351,094 175,547 526,642 263,321 789,964 394,982 197,491 592,474 296,237 888,712 444,356 222,178 111,089 333,268 166,634 83,317 249,952 124,976 62,488 31,244 15,622 7,811 23,434 11,717 35,152 17,576 8,788 4,394 2,197 6,592 3,296 1,648 824 412 206 103 310 155 466 233 700 350 175 526 263 790 395 1,186 593 1,780 890 445

← Previous Integer #2,496,665 Browse Full Index Next Integer #2,496,667 →