5,068,680

2³ × 3 × 5 × 42239

5,068,680 factors as 2^3 × 3 × 5 × 42239. Its 32 positive divisors give a proper-divisor sum of 10,137,720, so this integer is abundant. The Collatz stopping time is 105 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 5 × 42239

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 15,206,400

Proper Divisor Sum 10,137,720

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #5068633 ← → #5068691

Radix Representation

Decimal	5068680
Binary	10011010101011110001000 (23 bits)
Octal	0o23253610
Hexadecimal	0x4D5788

Divisor Catalog (32)

1 2 3 4 5 6 8 10 12 15 20 24 30 40 60 120 42,239 84,478 126,717 168,956 211,195 253,434 337,912 422,390 506,868 633,585 844,780 1,013,736 1,267,170 1,689,560 2,534,340 5,068,680

Collatz Trajectory (105 steps to reach 1)

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

5,068,680 2,534,340 1,267,170 633,585 1,900,756 950,378 475,189 1,425,568 712,784 356,392 178,196 89,098 44,549 133,648 66,824 33,412 16,706 8,353 25,060 12,530 6,265 18,796 9,398 4,699 14,098 7,049 21,148 10,574 5,287 15,862 7,931 23,794 11,897 35,692 17,846 8,923 26,770 13,385 40,156 20,078 10,039 30,118 15,059 45,178 22,589 67,768 33,884 16,942 8,471 25,414 12,707 38,122 19,061 57,184 28,592 14,296 7,148 3,574 1,787 5,362

← Previous Integer #5,068,679 Browse Full Index Next Integer #5,068,681 →