5,000,550

2 × 3 × 5² × 17 × 37 × 53

5,000,550 factors as 2 × 3 × 5^2 × 17 × 37 × 53. Its 96 positive divisors give a proper-divisor sum of 8,739,642, so this integer is abundant. The Collatz stopping time is 113 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5^2 × 17 × 37 × 53

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 13,740,192

Proper Divisor Sum 8,739,642

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #5000549 ← → #5000551

Radix Representation

Decimal	5000550
Binary	10011000100110101100110 (23 bits)
Octal	0o23046546
Hexadecimal	0x4C4D66

Divisor Catalog (60 of 96)

1 2 3 5 6 10 15 17 25 30 34 37 50 51 53 74 75 85 102 106 111 150 159 170 185 222 255 265 318 370 425 510 530 555 629 795 850 901 925 1,110 1,258 1,275 1,325 1,590 1,802 1,850 1,887 1,961 2,550 2,650 2,703 2,775 3,145 3,774 3,922 3,975 4,505 5,406 5,550 5,883

Collatz Trajectory (113 steps to reach 1)

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

5,000,550 2,500,275 7,500,826 3,750,413 11,251,240 5,625,620 2,812,810 1,406,405 4,219,216 2,109,608 1,054,804 527,402 263,701 791,104 395,552 197,776 98,888 49,444 24,722 12,361 37,084 18,542 9,271 27,814 13,907 41,722 20,861 62,584 31,292 15,646 7,823 23,470 11,735 35,206 17,603 52,810 26,405 79,216 39,608 19,804 9,902 4,951 14,854 7,427 22,282 11,141 33,424 16,712 8,356 4,178 2,089 6,268 3,134 1,567 4,702 2,351 7,054 3,527 10,582 5,291

← Previous Integer #5,000,549 Browse Full Index Next Integer #5,000,551 →