6,000,672

2⁵ × 3 × 62507

6,000,672 factors as 2^5 × 3 × 62507. Its 24 positive divisors give a proper-divisor sum of 9,751,344, so this integer is abundant. The Collatz stopping time is 139 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 62507

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 15,752,016

Proper Divisor Sum 9,751,344

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #6000653 ← → #6000679

Radix Representation

Decimal	6000672
Binary	10110111001000000100000 (23 bits)
Octal	0o26710040
Hexadecimal	0x5B9020

Divisor Catalog (24)

Collatz Trajectory (139 steps to reach 1)

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

6,000,672 3,000,336 1,500,168 750,084 375,042 187,521 562,564 281,282 140,641 421,924 210,962 105,481 316,444 158,222 79,111 237,334 118,667 356,002 178,001 534,004 267,002 133,501 400,504 200,252 100,126 50,063 150,190 75,095 225,286 112,643 337,930 168,965 506,896 253,448 126,724 63,362 31,681 95,044 47,522 23,761 71,284 35,642 17,821 53,464 26,732 13,366 6,683 20,050 10,025 30,076 15,038 7,519 22,558 11,279 33,838 16,919 50,758 25,379 76,138 38,069

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,000,671 Browse Full Index Next Integer #6,000,673 →