5,888,022

2 × 3 × 7 × 140191

5,888,022 factors as 2 × 3 × 7 × 140191. Its 16 positive divisors give a proper-divisor sum of 7,570,410, so this integer is abundant. The Collatz stopping time is 90 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 140191

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 13,458,432

Proper Divisor Sum 7,570,410

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #5888021 ← → #5888039

Radix Representation

Decimal	5888022
Binary	10110011101100000010110 (23 bits)
Octal	0o26354026
Hexadecimal	0x59D816

Divisor Catalog (16)

1 2 3 6 7 14 21 42 140,191 280,382 420,573 841,146 981,337 1,962,674 2,944,011 5,888,022

Collatz Trajectory (90 steps to reach 1)

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

5,888,022 2,944,011 8,832,034 4,416,017 13,248,052 6,624,026 3,312,013 9,936,040 4,968,020 2,484,010 1,242,005 3,726,016 1,863,008 931,504 465,752 232,876 116,438 58,219 174,658 87,329 261,988 130,994 65,497 196,492 98,246 49,123 147,370 73,685 221,056 110,528 55,264 27,632 13,816 6,908 3,454 1,727 5,182 2,591 7,774 3,887 11,662 5,831 17,494 8,747 26,242 13,121 39,364 19,682 9,841 29,524 14,762 7,381 22,144 11,072 5,536 2,768 1,384 692 346 173

← Previous Integer #5,888,021 Browse Full Index Next Integer #5,888,023 →