8,556,906

2 × 3 × 1426151

8,556,906 factors as 2 × 3 × 1426151. Its 8 positive divisors give a proper-divisor sum of 8,556,918, so this integer is abundant. The Collatz stopping time is 98 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1426151

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 17,113,824

Proper Divisor Sum 8,556,918

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #8556893 ← → #8556907

Radix Representation

Decimal	8556906
Binary	100000101001000101101010 (24 bits)
Octal	0o40510552
Hexadecimal	0x82916A

Divisor Catalog (8)

1 2 3 6 1,426,151 2,852,302 4,278,453 8,556,906

Collatz Trajectory (98 steps to reach 1)

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

8,556,906 4,278,453 12,835,360 6,417,680 3,208,840 1,604,420 802,210 401,105 1,203,316 601,658 300,829 902,488 451,244 225,622 112,811 338,434 169,217 507,652 253,826 126,913 380,740 190,370 95,185 285,556 142,778 71,389 214,168 107,084 53,542 26,771 80,314 40,157 120,472 60,236 30,118 15,059 45,178 22,589 67,768 33,884 16,942 8,471 25,414 12,707 38,122 19,061 57,184 28,592 14,296 7,148 3,574 1,787 5,362 2,681 8,044 4,022 2,011 6,034 3,017 9,052

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #8,556,905 Browse Full Index Next Integer #8,556,907 →