1,678,300

2² × 5² × 13 × 1291

1,678,300 factors as 2^2 × 5^2 × 13 × 1291. Its 36 positive divisors give a proper-divisor sum of 2,246,796, so this integer is abundant. The Collatz stopping time is 114 steps.

Prime Factor Structure

Factorization String 2^2 × 5^2 × 13 × 1291

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 3,925,096

Proper Divisor Sum 2,246,796

Digit Sum / Digital Root 25 (Root: 7)

Adjacent Primes #1678277 ← → #1678301

Radix Representation

Decimal	1678300
Binary	110011001101111011100 (21 bits)
Octal	0o6315734
Hexadecimal	0x199BDC

Divisor Catalog (36)

1 2 4 5 10 13 20 25 26 50 52 65 100 130 260 325 650 1,291 1,300 2,582 5,164 6,455 12,910 16,783 25,820 32,275 33,566 64,550 67,132 83,915 129,100 167,830 335,660 419,575 839,150 1,678,300

Collatz Trajectory (114 steps to reach 1)

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

1,678,300 839,150 419,575 1,258,726 629,363 1,888,090 944,045 2,832,136 1,416,068 708,034 354,017 1,062,052 531,026 265,513 796,540 398,270 199,135 597,406 298,703 896,110 448,055 1,344,166 672,083 2,016,250 1,008,125 3,024,376 1,512,188 756,094 378,047 1,134,142 567,071 1,701,214 850,607 2,551,822 1,275,911 3,827,734 1,913,867 5,741,602 2,870,801 8,612,404 4,306,202 2,153,101 6,459,304 3,229,652 1,614,826 807,413 2,422,240 1,211,120 605,560 302,780 151,390 75,695 227,086 113,543 340,630 170,315 510,946 255,473 766,420 383,210

← Previous Integer #1,678,299 Browse Full Index Next Integer #1,678,301 →