2,606,800

2⁴ × 5² × 7³ × 19

2,606,800 factors as 2^4 × 5^2 × 7^3 × 19. Its 120 positive divisors give a proper-divisor sum of 5,081,200, so this integer is abundant. The Collatz stopping time is 187 steps.

Prime Factor Structure

Factorization String 2^4 × 5^2 × 7^3 × 19

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 120

Divisor Sum (σ) 7,688,000

Proper Divisor Sum 5,081,200

Digit Sum / Digital Root 22 (Root: 4)

Adjacent Primes #2606783 ← → #2606803

Radix Representation

Decimal	2606800
Binary	1001111100011011010000 (22 bits)
Octal	0o11743320
Hexadecimal	0x27C6D0

Divisor Catalog (60 of 120)

1 2 4 5 7 8 10 14 16 19 20 25 28 35 38 40 49 50 56 70 76 80 95 98 100 112 133 140 152 175 190 196 200 245 266 280 304 343 350 380 392 400 475 490 532 560 665 686 700 760 784 931 950 980 1,064 1,225 1,330 1,372 1,400 1,520

Collatz Trajectory (187 steps to reach 1)

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

2,606,800 1,303,400 651,700 325,850 162,925 488,776 244,388 122,194 61,097 183,292 91,646 45,823 137,470 68,735 206,206 103,103 309,310 154,655 463,966 231,983 695,950 347,975 1,043,926 521,963 1,565,890 782,945 2,348,836 1,174,418 587,209 1,761,628 880,814 440,407 1,321,222 660,611 1,981,834 990,917 2,972,752 1,486,376 743,188 371,594 185,797 557,392 278,696 139,348 69,674 34,837 104,512 52,256 26,128 13,064 6,532 3,266 1,633 4,900 2,450 1,225 3,676 1,838 919 2,758

← Previous Integer #2,606,799 Browse Full Index Next Integer #2,606,801 →