2,665,428

2² × 3 × 389 × 571

2,665,428 factors as 2^2 × 3 × 389 × 571. Its 24 positive divisors give a proper-divisor sum of 3,580,812, so this integer is abundant. The Collatz stopping time is 187 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 389 × 571

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 6,246,240

Proper Divisor Sum 3,580,812

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2665427 ← → #2665433

Radix Representation

Decimal	2665428
Binary	1010001010101111010100 (22 bits)
Octal	0o12125724
Hexadecimal	0x28ABD4

Divisor Catalog (24)

1 2 3 4 6 12 389 571 778 1,142 1,167 1,556 1,713 2,284 2,334 3,426 4,668 6,852 222,119 444,238 666,357 888,476 1,332,714 2,665,428

Collatz Trajectory (187 steps to reach 1)

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

2,665,428 1,332,714 666,357 1,999,072 999,536 499,768 249,884 124,942 62,471 187,414 93,707 281,122 140,561 421,684 210,842 105,421 316,264 158,132 79,066 39,533 118,600 59,300 29,650 14,825 44,476 22,238 11,119 33,358 16,679 50,038 25,019 75,058 37,529 112,588 56,294 28,147 84,442 42,221 126,664 63,332 31,666 15,833 47,500 23,750 11,875 35,626 17,813 53,440 26,720 13,360 6,680 3,340 1,670 835 2,506 1,253 3,760 1,880 940 470

← Previous Integer #2,665,427 Browse Full Index Next Integer #2,665,429 →