6,604,528

2⁴ × 7 × 109 × 541

6,604,528 factors as 2^4 × 7 × 109 × 541. Its 40 positive divisors give a proper-divisor sum of 8,181,232, so this integer is abundant. The Collatz stopping time is 196 steps.

Prime Factor Structure

Factorization String 2^4 × 7 × 109 × 541

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 14,785,760

Proper Divisor Sum 8,181,232

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #6604471 ← → #6604561

Radix Representation

Decimal	6604528
Binary	11001001100011011110000 (23 bits)
Octal	0o31143360
Hexadecimal	0x64C6F0

Divisor Catalog (40)

1 2 4 7 8 14 16 28 56 109 112 218 436 541 763 872 1,082 1,526 1,744 2,164 3,052 3,787 4,328 6,104 7,574 8,656 12,208 15,148 30,296 58,969 60,592 117,938 235,876 412,783 471,752 825,566 943,504 1,651,132 3,302,264 6,604,528

Collatz Trajectory (196 steps to reach 1)

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

6,604,528 3,302,264 1,651,132 825,566 412,783 1,238,350 619,175 1,857,526 928,763 2,786,290 1,393,145 4,179,436 2,089,718 1,044,859 3,134,578 1,567,289 4,701,868 2,350,934 1,175,467 3,526,402 1,763,201 5,289,604 2,644,802 1,322,401 3,967,204 1,983,602 991,801 2,975,404 1,487,702 743,851 2,231,554 1,115,777 3,347,332 1,673,666 836,833 2,510,500 1,255,250 627,625 1,882,876 941,438 470,719 1,412,158 706,079 2,118,238 1,059,119 3,177,358 1,588,679 4,766,038 2,383,019 7,149,058 3,574,529 10,723,588 5,361,794 2,680,897 8,042,692 4,021,346 2,010,673 6,032,020 3,016,010 1,508,005

← Previous Integer #6,604,527 Browse Full Index Next Integer #6,604,529 →