8,228,550

2 × 3 × 5² × 11 × 4987

8,228,550 factors as 2 × 3 × 5^2 × 11 × 4987. Its 48 positive divisors give a proper-divisor sum of 14,037,882, so this integer is abundant. The Collatz stopping time is 137 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5^2 × 11 × 4987

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 22,266,432

Proper Divisor Sum 14,037,882

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #8228543 ← → #8228551

Radix Representation

Decimal	8228550
Binary	11111011000111011000110 (23 bits)
Octal	0o37307306
Hexadecimal	0x7D8EC6

Divisor Catalog (48)

1 2 3 5 6 10 11 15 22 25 30 33 50 55 66 75 110 150 165 275 330 550 825 1,650 4,987 9,974 14,961 24,935 29,922 49,870 54,857 74,805 109,714 124,675 149,610 164,571 249,350 274,285 329,142 374,025 548,570 748,050 822,855 1,371,425 1,645,710 2,742,850 4,114,275 8,228,550

Collatz Trajectory (137 steps to reach 1)

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

8,228,550 4,114,275 12,342,826 6,171,413 18,514,240 9,257,120 4,628,560 2,314,280 1,157,140 578,570 289,285 867,856 433,928 216,964 108,482 54,241 162,724 81,362 40,681 122,044 61,022 30,511 91,534 45,767 137,302 68,651 205,954 102,977 308,932 154,466 77,233 231,700 115,850 57,925 173,776 86,888 43,444 21,722 10,861 32,584 16,292 8,146 4,073 12,220 6,110 3,055 9,166 4,583 13,750 6,875 20,626 10,313 30,940 15,470 7,735 23,206 11,603 34,810 17,405 52,216

← Previous Integer #8,228,549 Browse Full Index Next Integer #8,228,551 →