5,779,220

2² × 5 × 101 × 2861

5,779,220 factors as 2^2 × 5 × 101 × 2861. Its 24 positive divisors give a proper-divisor sum of 6,481,588, so this integer is abundant. The Collatz stopping time is 95 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 101 × 2861

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 12,260,808

Proper Divisor Sum 6,481,588

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #5779217 ← → #5779231

Radix Representation

Decimal	5779220
Binary	10110000010111100010100 (23 bits)
Octal	0o26027424
Hexadecimal	0x582F14

Divisor Catalog (24)

Collatz Trajectory (95 steps to reach 1)

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

5,779,220 2,889,610 1,444,805 4,334,416 2,167,208 1,083,604 541,802 270,901 812,704 406,352 203,176 101,588 50,794 25,397 76,192 38,096 19,048 9,524 4,762 2,381 7,144 3,572 1,786 893 2,680 1,340 670 335 1,006 503 1,510 755 2,266 1,133 3,400 1,700 850 425 1,276 638 319 958 479 1,438 719 2,158 1,079 3,238 1,619 4,858 2,429 7,288 3,644 1,822 911 2,734 1,367 4,102 2,051 6,154

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,779,219 Browse Full Index Next Integer #5,779,221 →