8,876,646

2 × 3² × 493147

8,876,646 factors as 2 × 3^2 × 493147. Its 12 positive divisors give a proper-divisor sum of 10,356,126, so this integer is abundant. The Collatz stopping time is 287 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 493147

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 19,232,772

Proper Divisor Sum 10,356,126

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #8876627 ← → #8876653

Radix Representation

Decimal	8876646
Binary	100001110111001001100110 (24 bits)
Octal	0o41671146
Hexadecimal	0x877266

Divisor Catalog (12)

1 2 3 6 9 18 493,147 986,294 1,479,441 2,958,882 4,438,323 8,876,646

Collatz Trajectory (287 steps to reach 1)

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

8,876,646 4,438,323 13,314,970 6,657,485 19,972,456 9,986,228 4,993,114 2,496,557 7,489,672 3,744,836 1,872,418 936,209 2,808,628 1,404,314 702,157 2,106,472 1,053,236 526,618 263,309 789,928 394,964 197,482 98,741 296,224 148,112 74,056 37,028 18,514 9,257 27,772 13,886 6,943 20,830 10,415 31,246 15,623 46,870 23,435 70,306 35,153 105,460 52,730 26,365 79,096 39,548 19,774 9,887 29,662 14,831 44,494 22,247 66,742 33,371 100,114 50,057 150,172 75,086 37,543 112,630 56,315

← Previous Integer #8,876,645 Browse Full Index Next Integer #8,876,647 →