8,227,548

2² × 3³ × 7 × 10883

8,227,548 factors as 2^2 × 3^3 × 7 × 10883. Its 48 positive divisors give a proper-divisor sum of 16,152,612, so this integer is abundant. The Collatz stopping time is 80 steps.

Prime Factor Structure

Factorization String 2^2 × 3^3 × 7 × 10883

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 24,380,160

Proper Divisor Sum 16,152,612

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #8227547 ← → #8227553

Radix Representation

Decimal	8227548
Binary	11111011000101011011100 (23 bits)
Octal	0o37305334
Hexadecimal	0x7D8ADC

Divisor Catalog (48)

1 2 3 4 6 7 9 12 14 18 21 27 28 36 42 54 63 84 108 126 189 252 378 756 10,883 21,766 32,649 43,532 65,298 76,181 97,947 130,596 152,362 195,894 228,543 293,841 304,724 391,788 457,086 587,682 685,629 914,172 1,175,364 1,371,258 2,056,887 2,742,516 4,113,774 8,227,548

Collatz Trajectory (80 steps to reach 1)

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

8,227,548 4,113,774 2,056,887 6,170,662 3,085,331 9,255,994 4,627,997 13,883,992 6,941,996 3,470,998 1,735,499 5,206,498 2,603,249 7,809,748 3,904,874 1,952,437 5,857,312 2,928,656 1,464,328 732,164 366,082 183,041 549,124 274,562 137,281 411,844 205,922 102,961 308,884 154,442 77,221 231,664 115,832 57,916 28,958 14,479 43,438 21,719 65,158 32,579 97,738 48,869 146,608 73,304 36,652 18,326 9,163 27,490 13,745 41,236 20,618 10,309 30,928 15,464 7,732 3,866 1,933 5,800 2,900 1,450

← Previous Integer #8,227,547 Browse Full Index Next Integer #8,227,549 →