5,100,970

2 × 5 × 7 × 72871

5,100,970 factors as 2 × 5 × 7 × 72871. Its 16 positive divisors give a proper-divisor sum of 5,392,598, so this integer is abundant. The Collatz stopping time is 82 steps.

Prime Factor Structure

Factorization String 2 × 5 × 7 × 72871

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 10,493,568

Proper Divisor Sum 5,392,598

Digit Sum / Digital Root 22 (Root: 4)

Adjacent Primes #5100959 ← → #5100971

Radix Representation

Decimal	5100970
Binary	10011011101010110101010 (23 bits)
Octal	0o23352652
Hexadecimal	0x4DD5AA

Divisor Catalog (16)

1 2 5 7 10 14 35 70 72,871 145,742 364,355 510,097 728,710 1,020,194 2,550,485 5,100,970

Collatz Trajectory (82 steps to reach 1)

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

5,100,970 2,550,485 7,651,456 3,825,728 1,912,864 956,432 478,216 239,108 119,554 59,777 179,332 89,666 44,833 134,500 67,250 33,625 100,876 50,438 25,219 75,658 37,829 113,488 56,744 28,372 14,186 7,093 21,280 10,640 5,320 2,660 1,330 665 1,996 998 499 1,498 749 2,248 1,124 562 281 844 422 211 634 317 952 476 238 119 358 179 538 269 808 404 202 101 304 152

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,100,969 Browse Full Index Next Integer #5,100,971 →