8,827,650

2 × 3³ × 5² × 13 × 503

8,827,650 factors as 2 × 3^3 × 5^2 × 13 × 503. Its 96 positive divisors give a proper-divisor sum of 17,420,670, so this integer is abundant. The Collatz stopping time is 194 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 5^2 × 13 × 503

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 26,248,320

Proper Divisor Sum 17,420,670

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #8827649 ← → #8827667

Radix Representation

Decimal	8827650
Binary	100001101011001100000010 (24 bits)
Octal	0o41531402
Hexadecimal	0x86B302

Divisor Catalog (60 of 96)

1 2 3 5 6 9 10 13 15 18 25 26 27 30 39 45 50 54 65 75 78 90 117 130 135 150 195 225 234 270 325 351 390 450 503 585 650 675 702 975 1,006 1,170 1,350 1,509 1,755 1,950 2,515 2,925 3,018 3,510 4,527 5,030 5,850 6,539 7,545 8,775 9,054 12,575 13,078 13,581

Collatz Trajectory (194 steps to reach 1)

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

8,827,650 4,413,825 13,241,476 6,620,738 3,310,369 9,931,108 4,965,554 2,482,777 7,448,332 3,724,166 1,862,083 5,586,250 2,793,125 8,379,376 4,189,688 2,094,844 1,047,422 523,711 1,571,134 785,567 2,356,702 1,178,351 3,535,054 1,767,527 5,302,582 2,651,291 7,953,874 3,976,937 11,930,812 5,965,406 2,982,703 8,948,110 4,474,055 13,422,166 6,711,083 20,133,250 10,066,625 30,199,876 15,099,938 7,549,969 22,649,908 11,324,954 5,662,477 16,987,432 8,493,716 4,246,858 2,123,429 6,370,288 3,185,144 1,592,572 796,286 398,143 1,194,430 597,215 1,791,646 895,823 2,687,470 1,343,735 4,031,206 2,015,603

← Previous Integer #8,827,649 Browse Full Index Next Integer #8,827,651 →