5,067,330

2 × 3 × 5 × 53 × 3187

5,067,330 factors as 2 × 3 × 5 × 53 × 3187. Its 32 positive divisors give a proper-divisor sum of 7,327,614, so this integer is abundant. The Collatz stopping time is 131 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 53 × 3187

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 12,394,944

Proper Divisor Sum 7,327,614

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #5067329 ← → #5067371

Radix Representation

Decimal	5067330
Binary	10011010101001001000010 (23 bits)
Octal	0o23251102
Hexadecimal	0x4D5242

Divisor Catalog (32)

1 2 3 5 6 10 15 30 53 106 159 265 318 530 795 1,590 3,187 6,374 9,561 15,935 19,122 31,870 47,805 95,610 168,911 337,822 506,733 844,555 1,013,466 1,689,110 2,533,665 5,067,330

Collatz Trajectory (131 steps to reach 1)

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

5,067,330 2,533,665 7,600,996 3,800,498 1,900,249 5,700,748 2,850,374 1,425,187 4,275,562 2,137,781 6,413,344 3,206,672 1,603,336 801,668 400,834 200,417 601,252 300,626 150,313 450,940 225,470 112,735 338,206 169,103 507,310 253,655 760,966 380,483 1,141,450 570,725 1,712,176 856,088 428,044 214,022 107,011 321,034 160,517 481,552 240,776 120,388 60,194 30,097 90,292 45,146 22,573 67,720 33,860 16,930 8,465 25,396 12,698 6,349 19,048 9,524 4,762 2,381 7,144 3,572 1,786 893

← Previous Integer #5,067,329 Browse Full Index Next Integer #5,067,331 →