3,000,593

139 × 21587

3,000,593 factors as 139 × 21587. Its 4 positive divisors give a proper-divisor sum of 21,727, so this integer is deficient. The Collatz stopping time is 138 steps.

Prime Factor Structure

Factorization String 139 × 21587

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 3,022,320

Proper Divisor Sum 21,727

Digit Sum / Digital Root 20 (Root: 2)

Adjacent Primes #3000553 ← → #3000607

Radix Representation

Decimal	3000593
Binary	1011011100100100010001 (22 bits)
Octal	0o13344421
Hexadecimal	0x2DC911

Divisor Catalog (4)

1 139 21,587 3,000,593

Collatz Trajectory (138 steps to reach 1)

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

3,000,593 9,001,780 4,500,890 2,250,445 6,751,336 3,375,668 1,687,834 843,917 2,531,752 1,265,876 632,938 316,469 949,408 474,704 237,352 118,676 59,338 29,669 89,008 44,504 22,252 11,126 5,563 16,690 8,345 25,036 12,518 6,259 18,778 9,389 28,168 14,084 7,042 3,521 10,564 5,282 2,641 7,924 3,962 1,981 5,944 2,972 1,486 743 2,230 1,115 3,346 1,673 5,020 2,510 1,255 3,766 1,883 5,650 2,825 8,476 4,238 2,119 6,358 3,179

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,000,592 Browse Full Index Next Integer #3,000,594 →