5,668,878

2 × 3 × 19 × 49727

5,668,878 factors as 2 × 3 × 19 × 49727. Its 16 positive divisors give a proper-divisor sum of 6,265,842, so this integer is abundant. The Collatz stopping time is 139 steps.

Prime Factor Structure

Factorization String 2 × 3 × 19 × 49727

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 11,934,720

Proper Divisor Sum 6,265,842

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #5668867 ← → #5668903

Radix Representation

Decimal	5668878
Binary	10101101000000000001110 (23 bits)
Octal	0o25500016
Hexadecimal	0x56800E

Divisor Catalog (16)

1 2 3 6 19 38 57 114 49,727 99,454 149,181 298,362 944,813 1,889,626 2,834,439 5,668,878

Collatz Trajectory (139 steps to reach 1)

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

5,668,878 2,834,439 8,503,318 4,251,659 12,754,978 6,377,489 19,132,468 9,566,234 4,783,117 14,349,352 7,174,676 3,587,338 1,793,669 5,381,008 2,690,504 1,345,252 672,626 336,313 1,008,940 504,470 252,235 756,706 378,353 1,135,060 567,530 283,765 851,296 425,648 212,824 106,412 53,206 26,603 79,810 39,905 119,716 59,858 29,929 89,788 44,894 22,447 67,342 33,671 101,014 50,507 151,522 75,761 227,284 113,642 56,821 170,464 85,232 42,616 21,308 10,654 5,327 15,982 7,991 23,974 11,987 35,962

← Previous Integer #5,668,877 Browse Full Index Next Integer #5,668,879 →