5,160,378

2 × 3 × 860063

5,160,378 factors as 2 × 3 × 860063. Its 8 positive divisors give a proper-divisor sum of 5,160,390, so this integer is abundant. The Collatz stopping time is 100 steps.

Prime Factor Structure

Factorization String 2 × 3 × 860063

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 10,320,768

Proper Divisor Sum 5,160,390

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #5160377 ← → #5160409

Radix Representation

Decimal	5160378
Binary	10011101011110110111010 (23 bits)
Octal	0o23536672
Hexadecimal	0x4EBDBA

Divisor Catalog (8)

1 2 3 6 860,063 1,720,126 2,580,189 5,160,378

Collatz Trajectory (100 steps to reach 1)

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

5,160,378 2,580,189 7,740,568 3,870,284 1,935,142 967,571 2,902,714 1,451,357 4,354,072 2,177,036 1,088,518 544,259 1,632,778 816,389 2,449,168 1,224,584 612,292 306,146 153,073 459,220 229,610 114,805 344,416 172,208 86,104 43,052 21,526 10,763 32,290 16,145 48,436 24,218 12,109 36,328 18,164 9,082 4,541 13,624 6,812 3,406 1,703 5,110 2,555 7,666 3,833 11,500 5,750 2,875 8,626 4,313 12,940 6,470 3,235 9,706 4,853 14,560 7,280 3,640 1,820 910

← Previous Integer #5,160,377 Browse Full Index Next Integer #5,160,379 →