8,459,682

2 × 3 × 7 × 11 × 18311

8,459,682 factors as 2 × 3 × 7 × 11 × 18311. Its 32 positive divisors give a proper-divisor sum of 12,635,742, so this integer is abundant. The Collatz stopping time is 80 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 11 × 18311

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 21,095,424

Proper Divisor Sum 12,635,742

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #8459657 ← → #8459723

Radix Representation

Decimal	8459682
Binary	100000010001010110100010 (24 bits)
Octal	0o40212642
Hexadecimal	0x8115A2

Divisor Catalog (32)

1 2 3 6 7 11 14 21 22 33 42 66 77 154 231 462 18,311 36,622 54,933 109,866 128,177 201,421 256,354 384,531 402,842 604,263 769,062 1,208,526 1,409,947 2,819,894 4,229,841 8,459,682

Collatz Trajectory (80 steps to reach 1)

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

8,459,682 4,229,841 12,689,524 6,344,762 3,172,381 9,517,144 4,758,572 2,379,286 1,189,643 3,568,930 1,784,465 5,353,396 2,676,698 1,338,349 4,015,048 2,007,524 1,003,762 501,881 1,505,644 752,822 376,411 1,129,234 564,617 1,693,852 846,926 423,463 1,270,390 635,195 1,905,586 952,793 2,858,380 1,429,190 714,595 2,143,786 1,071,893 3,215,680 1,607,840 803,920 401,960 200,980 100,490 50,245 150,736 75,368 37,684 18,842 9,421 28,264 14,132 7,066 3,533 10,600 5,300 2,650 1,325 3,976 1,988 994 497 1,492

← Previous Integer #8,459,681 Browse Full Index Next Integer #8,459,683 →