2,029,110

2 × 3 × 5 × 239 × 283

2,029,110 factors as 2 × 3 × 5 × 239 × 283. Its 32 positive divisors give a proper-divisor sum of 2,878,410, so this integer is abundant. The Collatz stopping time is 259 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 239 × 283

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 4,907,520

Proper Divisor Sum 2,878,410

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #2029091 ← → #2029121

Radix Representation

Decimal	2029110
Binary	111101111011000110110 (21 bits)
Octal	0o7573066
Hexadecimal	0x1EF636

Divisor Catalog (32)

1 2 3 5 6 10 15 30 239 283 478 566 717 849 1,195 1,415 1,434 1,698 2,390 2,830 3,585 4,245 7,170 8,490 67,637 135,274 202,911 338,185 405,822 676,370 1,014,555 2,029,110

Collatz Trajectory (259 steps to reach 1)

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

2,029,110 1,014,555 3,043,666 1,521,833 4,565,500 2,282,750 1,141,375 3,424,126 1,712,063 5,136,190 2,568,095 7,704,286 3,852,143 11,556,430 5,778,215 17,334,646 8,667,323 26,001,970 13,000,985 39,002,956 19,501,478 9,750,739 29,252,218 14,626,109 43,878,328 21,939,164 10,969,582 5,484,791 16,454,374 8,227,187 24,681,562 12,340,781 37,022,344 18,511,172 9,255,586 4,627,793 13,883,380 6,941,690 3,470,845 10,412,536 5,206,268 2,603,134 1,301,567 3,904,702 1,952,351 5,857,054 2,928,527 8,785,582 4,392,791 13,178,374 6,589,187 19,767,562 9,883,781 29,651,344 14,825,672 7,412,836 3,706,418 1,853,209 5,559,628 2,779,814

← Previous Integer #2,029,109 Browse Full Index Next Integer #2,029,111 →