8,555,562

2 × 3² × 421 × 1129

8,555,562 factors as 2 × 3^2 × 421 × 1129. Its 24 positive divisors give a proper-divisor sum of 10,041,978, so this integer is abundant. The Collatz stopping time is 124 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 421 × 1129

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 18,597,540

Proper Divisor Sum 10,041,978

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #8555549 ← → #8555579

Radix Representation

Decimal	8555562
Binary	100000101000110000101010 (24 bits)
Octal	0o40506052
Hexadecimal	0x828C2A

Divisor Catalog (24)

Collatz Trajectory (124 steps to reach 1)

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

8,555,562 4,277,781 12,833,344 6,416,672 3,208,336 1,604,168 802,084 401,042 200,521 601,564 300,782 150,391 451,174 225,587 676,762 338,381 1,015,144 507,572 253,786 126,893 380,680 190,340 95,170 47,585 142,756 71,378 35,689 107,068 53,534 26,767 80,302 40,151 120,454 60,227 180,682 90,341 271,024 135,512 67,756 33,878 16,939 50,818 25,409 76,228 38,114 19,057 57,172 28,586 14,293 42,880 21,440 10,720 5,360 2,680 1,340 670 335 1,006 503 1,510

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #8,555,561 Browse Full Index Next Integer #8,555,563 →