5,000,570

2 × 5 × 500057

5,000,570 factors as 2 × 5 × 500057. Its 8 positive divisors give a proper-divisor sum of 4,000,474, so this integer is deficient. The Collatz stopping time is 175 steps.

Prime Factor Structure

Factorization String 2 × 5 × 500057

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 9,001,044

Proper Divisor Sum 4,000,474

Digit Sum / Digital Root 17 (Root: 8)

Adjacent Primes #5000563 ← → #5000581

Radix Representation

Decimal	5000570
Binary	10011000100110101111010 (23 bits)
Octal	0o23046572
Hexadecimal	0x4C4D7A

Divisor Catalog (8)

1 2 5 10 500,057 1,000,114 2,500,285 5,000,570

Collatz Trajectory (175 steps to reach 1)

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

5,000,570 2,500,285 7,500,856 3,750,428 1,875,214 937,607 2,812,822 1,406,411 4,219,234 2,109,617 6,328,852 3,164,426 1,582,213 4,746,640 2,373,320 1,186,660 593,330 296,665 889,996 444,998 222,499 667,498 333,749 1,001,248 500,624 250,312 125,156 62,578 31,289 93,868 46,934 23,467 70,402 35,201 105,604 52,802 26,401 79,204 39,602 19,801 59,404 29,702 14,851 44,554 22,277 66,832 33,416 16,708 8,354 4,177 12,532 6,266 3,133 9,400 4,700 2,350 1,175 3,526 1,763 5,290

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,000,569 Browse Full Index Next Integer #5,000,571 →