5,070,870

2 × 3³ × 5 × 7 × 2683

5,070,870 factors as 2 × 3^3 × 5 × 7 × 2683. Its 64 positive divisors give a proper-divisor sum of 10,388,970, so this integer is abundant. The Collatz stopping time is 131 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 5 × 7 × 2683

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 15,459,840

Proper Divisor Sum 10,388,970

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #5070851 ← → #5070883

Radix Representation

Decimal	5070870
Binary	10011010110000000010110 (23 bits)
Octal	0o23260026
Hexadecimal	0x4D6016

Divisor Catalog (60 of 64)

1 2 3 5 6 7 9 10 14 15 18 21 27 30 35 42 45 54 63 70 90 105 126 135 189 210 270 315 378 630 945 1,890 2,683 5,366 8,049 13,415 16,098 18,781 24,147 26,830 37,562 40,245 48,294 56,343 72,441 80,490 93,905 112,686 120,735 144,882 169,029 187,810 241,470 281,715 338,058 362,205 507,087 563,430 724,410 845,145

Collatz Trajectory (131 steps to reach 1)

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

5,070,870 2,535,435 7,606,306 3,803,153 11,409,460 5,704,730 2,852,365 8,557,096 4,278,548 2,139,274 1,069,637 3,208,912 1,604,456 802,228 401,114 200,557 601,672 300,836 150,418 75,209 225,628 112,814 56,407 169,222 84,611 253,834 126,917 380,752 190,376 95,188 47,594 23,797 71,392 35,696 17,848 8,924 4,462 2,231 6,694 3,347 10,042 5,021 15,064 7,532 3,766 1,883 5,650 2,825 8,476 4,238 2,119 6,358 3,179 9,538 4,769 14,308 7,154 3,577 10,732 5,366

← Previous Integer #5,070,869 Browse Full Index Next Integer #5,070,871 →