3,062,550

2 × 3 × 5² × 17 × 1201

3,062,550 factors as 2 × 3 × 5^2 × 17 × 1201. Its 48 positive divisors give a proper-divisor sum of 4,986,042, so this integer is abundant. The Collatz stopping time is 63 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5^2 × 17 × 1201

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 8,048,592

Proper Divisor Sum 4,986,042

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #3062539 ← → #3062551

Radix Representation

Decimal	3062550
Binary	1011101011101100010110 (22 bits)
Octal	0o13535426
Hexadecimal	0x2EBB16

Divisor Catalog (48)

1 2 3 5 6 10 15 17 25 30 34 50 51 75 85 102 150 170 255 425 510 850 1,201 1,275 2,402 2,550 3,603 6,005 7,206 12,010 18,015 20,417 30,025 36,030 40,834 60,050 61,251 90,075 102,085 122,502 180,150 204,170 306,255 510,425 612,510 1,020,850 1,531,275 3,062,550

Collatz Trajectory (63 steps to reach 1)

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

3,062,550 1,531,275 4,593,826 2,296,913 6,890,740 3,445,370 1,722,685 5,168,056 2,584,028 1,292,014 646,007 1,938,022 969,011 2,907,034 1,453,517 4,360,552 2,180,276 1,090,138 545,069 1,635,208 817,604 408,802 204,401 613,204 306,602 153,301 459,904 229,952 114,976 57,488 28,744 14,372 7,186 3,593 10,780 5,390 2,695 8,086 4,043 12,130 6,065 18,196 9,098 4,549 13,648 6,824 3,412 1,706 853 2,560 1,280 640 320 160 80 40 20 10 5 16

← Previous Integer #3,062,549 Browse Full Index Next Integer #3,062,551 →