6,003,560

2³ × 5 × 150089

6,003,560 factors as 2^3 × 5 × 150089. Its 16 positive divisors give a proper-divisor sum of 7,504,540, so this integer is abundant. The Collatz stopping time is 90 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 150089

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 13,508,100

Proper Divisor Sum 7,504,540

Digit Sum / Digital Root 20 (Root: 2)

Adjacent Primes #6003539 ← → #6003581

Radix Representation

Decimal	6003560
Binary	10110111001101101101000 (23 bits)
Octal	0o26715550
Hexadecimal	0x5B9B68

Divisor Catalog (16)

1 2 4 5 8 10 20 40 150,089 300,178 600,356 750,445 1,200,712 1,500,890 3,001,780 6,003,560

Collatz Trajectory (90 steps to reach 1)

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

6,003,560 3,001,780 1,500,890 750,445 2,251,336 1,125,668 562,834 281,417 844,252 422,126 211,063 633,190 316,595 949,786 474,893 1,424,680 712,340 356,170 178,085 534,256 267,128 133,564 66,782 33,391 100,174 50,087 150,262 75,131 225,394 112,697 338,092 169,046 84,523 253,570 126,785 380,356 190,178 95,089 285,268 142,634 71,317 213,952 106,976 53,488 26,744 13,372 6,686 3,343 10,030 5,015 15,046 7,523 22,570 11,285 33,856 16,928 8,464 4,232 2,116 1,058

← Previous Integer #6,003,559 Browse Full Index Next Integer #6,003,561 →