8,606,660

2² × 5 × 430333

8,606,660 factors as 2^2 × 5 × 430333. Its 12 positive divisors give a proper-divisor sum of 9,467,368, so this integer is abundant. The Collatz stopping time is 168 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 430333

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 18,074,028

Proper Divisor Sum 9,467,368

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #8606657 ← → #8606693

Radix Representation

Decimal	8606660
Binary	100000110101001111000100 (24 bits)
Octal	0o40651704
Hexadecimal	0x8353C4

Divisor Catalog (12)

1 2 4 5 10 20 430,333 860,666 1,721,332 2,151,665 4,303,330 8,606,660

Collatz Trajectory (168 steps to reach 1)

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

8,606,660 4,303,330 2,151,665 6,454,996 3,227,498 1,613,749 4,841,248 2,420,624 1,210,312 605,156 302,578 151,289 453,868 226,934 113,467 340,402 170,201 510,604 255,302 127,651 382,954 191,477 574,432 287,216 143,608 71,804 35,902 17,951 53,854 26,927 80,782 40,391 121,174 60,587 181,762 90,881 272,644 136,322 68,161 204,484 102,242 51,121 153,364 76,682 38,341 115,024 57,512 28,756 14,378 7,189 21,568 10,784 5,392 2,696 1,348 674 337 1,012 506 253

← Previous Integer #8,606,659 Browse Full Index Next Integer #8,606,661 →