2,605,218

2 × 3 × 7 × 11 × 5639

2,605,218 factors as 2 × 3 × 7 × 11 × 5639. Its 32 positive divisors give a proper-divisor sum of 3,892,062, so this integer is abundant. The Collatz stopping time is 68 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 11 × 5639

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 6,497,280

Proper Divisor Sum 3,892,062

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2605201 ← → #2605231

Radix Representation

Decimal	2605218
Binary	1001111100000010100010 (22 bits)
Octal	0o11740242
Hexadecimal	0x27C0A2

Divisor Catalog (32)

1 2 3 6 7 11 14 21 22 33 42 66 77 154 231 462 5,639 11,278 16,917 33,834 39,473 62,029 78,946 118,419 124,058 186,087 236,838 372,174 434,203 868,406 1,302,609 2,605,218

Collatz Trajectory (68 steps to reach 1)

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

2,605,218 1,302,609 3,907,828 1,953,914 976,957 2,930,872 1,465,436 732,718 366,359 1,099,078 549,539 1,648,618 824,309 2,472,928 1,236,464 618,232 309,116 154,558 77,279 231,838 115,919 347,758 173,879 521,638 260,819 782,458 391,229 1,173,688 586,844 293,422 146,711 440,134 220,067 660,202 330,101 990,304 495,152 247,576 123,788 61,894 30,947 92,842 46,421 139,264 69,632 34,816 17,408 8,704 4,352 2,176 1,088 544 272 136 68 34 17 52 26 13

← Previous Integer #2,605,217 Browse Full Index Next Integer #2,605,219 →