5,806,650

2 × 3 × 5² × 38711

5,806,650 factors as 2 × 3 × 5^2 × 38711. Its 24 positive divisors give a proper-divisor sum of 8,594,214, so this integer is abundant. The Collatz stopping time is 307 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5^2 × 38711

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 14,400,864

Proper Divisor Sum 8,594,214

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #5806643 ← → #5806657

Radix Representation

Decimal	5806650
Binary	10110001001101000111010 (23 bits)
Octal	0o26115072
Hexadecimal	0x589A3A

Divisor Catalog (24)

1 2 3 5 6 10 15 25 30 50 75 150 38,711 77,422 116,133 193,555 232,266 387,110 580,665 967,775 1,161,330 1,935,550 2,903,325 5,806,650

Collatz Trajectory (307 steps to reach 1)

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

5,806,650 2,903,325 8,709,976 4,354,988 2,177,494 1,088,747 3,266,242 1,633,121 4,899,364 2,449,682 1,224,841 3,674,524 1,837,262 918,631 2,755,894 1,377,947 4,133,842 2,066,921 6,200,764 3,100,382 1,550,191 4,650,574 2,325,287 6,975,862 3,487,931 10,463,794 5,231,897 15,695,692 7,847,846 3,923,923 11,771,770 5,885,885 17,657,656 8,828,828 4,414,414 2,207,207 6,621,622 3,310,811 9,932,434 4,966,217 14,898,652 7,449,326 3,724,663 11,173,990 5,586,995 16,760,986 8,380,493 25,141,480 12,570,740 6,285,370 3,142,685 9,428,056 4,714,028 2,357,014 1,178,507 3,535,522 1,767,761 5,303,284 2,651,642 1,325,821

← Previous Integer #5,806,649 Browse Full Index Next Integer #5,806,651 →