8,223,600

2⁴ × 3 × 5² × 7 × 11 × 89

8,223,600 factors as 2^4 × 3 × 5^2 × 7 × 11 × 89. Its 240 positive divisors give a proper-divisor sum of 24,988,560, so this integer is abundant. The Collatz stopping time is 62 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 5^2 × 7 × 11 × 89

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 240

Divisor Sum (σ) 33,212,160

Proper Divisor Sum 24,988,560

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #8223577 ← → #8223601

Radix Representation

Decimal	8223600
Binary	11111010111101101110000 (23 bits)
Octal	0o37275560
Hexadecimal	0x7D7B70

Divisor Catalog (60 of 240)

1 2 3 4 5 6 7 8 10 11 12 14 15 16 20 21 22 24 25 28 30 33 35 40 42 44 48 50 55 56 60 66 70 75 77 80 84 88 89 100 105 110 112 120 132 140 150 154 165 168 175 176 178 200 210 220 231 240 264 267

Collatz Trajectory (62 steps to reach 1)

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

8,223,600 4,111,800 2,055,900 1,027,950 513,975 1,541,926 770,963 2,312,890 1,156,445 3,469,336 1,734,668 867,334 433,667 1,301,002 650,501 1,951,504 975,752 487,876 243,938 121,969 365,908 182,954 91,477 274,432 137,216 68,608 34,304 17,152 8,576 4,288 2,144 1,072 536 268 134 67 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8

← Previous Integer #8,223,599 Browse Full Index Next Integer #8,223,601 →