8,510,604

2² × 3 × 709217

8,510,604 factors as 2^2 × 3 × 709217. Its 12 positive divisors give a proper-divisor sum of 11,347,500, so this integer is abundant. The Collatz stopping time is 168 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 709217

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 19,858,104

Proper Divisor Sum 11,347,500

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #8510539 ← → #8510609

Radix Representation

Decimal	8510604
Binary	100000011101110010001100 (24 bits)
Octal	0o40356214
Hexadecimal	0x81DC8C

Divisor Catalog (12)

1 2 3 4 6 12 709,217 1,418,434 2,127,651 2,836,868 4,255,302 8,510,604

Collatz Trajectory (168 steps to reach 1)

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

8,510,604 4,255,302 2,127,651 6,382,954 3,191,477 9,574,432 4,787,216 2,393,608 1,196,804 598,402 299,201 897,604 448,802 224,401 673,204 336,602 168,301 504,904 252,452 126,226 63,113 189,340 94,670 47,335 142,006 71,003 213,010 106,505 319,516 159,758 79,879 239,638 119,819 359,458 179,729 539,188 269,594 134,797 404,392 202,196 101,098 50,549 151,648 75,824 37,912 18,956 9,478 4,739 14,218 7,109 21,328 10,664 5,332 2,666 1,333 4,000 2,000 1,000 500 250

← Previous Integer #8,510,603 Browse Full Index Next Integer #8,510,605 →