5,052,834

2 × 3³ × 137 × 683

5,052,834 factors as 2 × 3^3 × 137 × 683. Its 32 positive divisors give a proper-divisor sum of 6,274,206, so this integer is abundant. The Collatz stopping time is 250 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 137 × 683

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 11,327,040

Proper Divisor Sum 6,274,206

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #5052833 ← → #5052851

Radix Representation

Decimal	5052834
Binary	10011010001100110100010 (23 bits)
Octal	0o23214642
Hexadecimal	0x4D19A2

Divisor Catalog (32)

1 2 3 6 9 18 27 54 137 274 411 683 822 1,233 1,366 2,049 2,466 3,699 4,098 6,147 7,398 12,294 18,441 36,882 93,571 187,142 280,713 561,426 842,139 1,684,278 2,526,417 5,052,834

Collatz Trajectory (250 steps to reach 1)

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

5,052,834 2,526,417 7,579,252 3,789,626 1,894,813 5,684,440 2,842,220 1,421,110 710,555 2,131,666 1,065,833 3,197,500 1,598,750 799,375 2,398,126 1,199,063 3,597,190 1,798,595 5,395,786 2,697,893 8,093,680 4,046,840 2,023,420 1,011,710 505,855 1,517,566 758,783 2,276,350 1,138,175 3,414,526 1,707,263 5,121,790 2,560,895 7,682,686 3,841,343 11,524,030 5,762,015 17,286,046 8,643,023 25,929,070 12,964,535 38,893,606 19,446,803 58,340,410 29,170,205 87,510,616 43,755,308 21,877,654 10,938,827 32,816,482 16,408,241 49,224,724 24,612,362 12,306,181 36,918,544 18,459,272 9,229,636 4,614,818 2,307,409 6,922,228

← Previous Integer #5,052,833 Browse Full Index Next Integer #5,052,835 →