8,220,224

2⁶ × 29 × 43 × 103

8,220,224 factors as 2^6 × 29 × 43 × 103. Its 56 positive divisors give a proper-divisor sum of 9,214,336, so this integer is abundant. The Collatz stopping time is 54 steps.

Prime Factor Structure

Factorization String 2^6 × 29 × 43 × 103

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 56

Divisor Sum (σ) 17,434,560

Proper Divisor Sum 9,214,336

Digit Sum / Digital Root 20 (Root: 2)

Adjacent Primes #8220221 ← → #8220229

Radix Representation

Decimal	8220224
Binary	11111010110111001000000 (23 bits)
Octal	0o37267100
Hexadecimal	0x7D6E40

Divisor Catalog (56)

1 2 4 8 16 29 32 43 58 64 86 103 116 172 206 232 344 412 464 688 824 928 1,247 1,376 1,648 1,856 2,494 2,752 2,987 3,296 4,429 4,988 5,974 6,592 8,858 9,976 11,948 17,716 19,952 23,896 35,432 39,904 47,792 70,864 79,808 95,584 128,441 141,728 191,168 256,882 283,456 513,764 1,027,528 2,055,056 4,110,112 8,220,224

Collatz Trajectory (54 steps to reach 1)

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

8,220,224 4,110,112 2,055,056 1,027,528 513,764 256,882 128,441 385,324 192,662 96,331 288,994 144,497 433,492 216,746 108,373 325,120 162,560 81,280 40,640 20,320 10,160 5,080 2,540 1,270 635 1,906 953 2,860 1,430 715 2,146 1,073 3,220 1,610 805 2,416 1,208 604 302 151 454 227 682 341 1,024 512 256 128 64 32 16 8 4 2 1

← Previous Integer #8,220,223 Browse Full Index Next Integer #8,220,225 →