5,886,696

2³ × 3 × 245279

5,886,696 factors as 2^3 × 3 × 245279. Its 16 positive divisors give a proper-divisor sum of 8,830,104, so this integer is abundant. The Collatz stopping time is 183 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 245279

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 14,716,800

Proper Divisor Sum 8,830,104

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #5886691 ← → #5886701

Radix Representation

Decimal	5886696
Binary	10110011101001011101000 (23 bits)
Octal	0o26351350
Hexadecimal	0x59D2E8

Divisor Catalog (16)

1 2 3 4 6 8 12 24 245,279 490,558 735,837 981,116 1,471,674 1,962,232 2,943,348 5,886,696

Collatz Trajectory (183 steps to reach 1)

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

5,886,696 2,943,348 1,471,674 735,837 2,207,512 1,103,756 551,878 275,939 827,818 413,909 1,241,728 620,864 310,432 155,216 77,608 38,804 19,402 9,701 29,104 14,552 7,276 3,638 1,819 5,458 2,729 8,188 4,094 2,047 6,142 3,071 9,214 4,607 13,822 6,911 20,734 10,367 31,102 15,551 46,654 23,327 69,982 34,991 104,974 52,487 157,462 78,731 236,194 118,097 354,292 177,146 88,573 265,720 132,860 66,430 33,215 99,646 49,823 149,470 74,735 224,206

← Previous Integer #5,886,695 Browse Full Index Next Integer #5,886,697 →