5,968,242

2 × 3⁴ × 7 × 19 × 277

5,968,242 factors as 2 × 3^4 × 7 × 19 × 277. Its 80 positive divisors give a proper-divisor sum of 10,177,998, so this integer is abundant. The Collatz stopping time is 258 steps.

Prime Factor Structure

Factorization String 2 × 3^4 × 7 × 19 × 277

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 80

Divisor Sum (σ) 16,146,240

Proper Divisor Sum 10,177,998

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #5968231 ← → #5968253

Radix Representation

Decimal	5968242
Binary	10110110001000101110010 (23 bits)
Octal	0o26610562
Hexadecimal	0x5B1172

Divisor Catalog (60 of 80)

1 2 3 6 7 9 14 18 19 21 27 38 42 54 57 63 81 114 126 133 162 171 189 266 277 342 378 399 513 554 567 798 831 1,026 1,134 1,197 1,539 1,662 1,939 2,394 2,493 3,078 3,591 3,878 4,986 5,263 5,817 7,182 7,479 10,526 10,773 11,634 14,958 15,789 17,451 21,546 22,437 31,578 34,902 36,841

Collatz Trajectory (258 steps to reach 1)

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

5,968,242 2,984,121 8,952,364 4,476,182 2,238,091 6,714,274 3,357,137 10,071,412 5,035,706 2,517,853 7,553,560 3,776,780 1,888,390 944,195 2,832,586 1,416,293 4,248,880 2,124,440 1,062,220 531,110 265,555 796,666 398,333 1,195,000 597,500 298,750 149,375 448,126 224,063 672,190 336,095 1,008,286 504,143 1,512,430 756,215 2,268,646 1,134,323 3,402,970 1,701,485 5,104,456 2,552,228 1,276,114 638,057 1,914,172 957,086 478,543 1,435,630 717,815 2,153,446 1,076,723 3,230,170 1,615,085 4,845,256 2,422,628 1,211,314 605,657 1,816,972 908,486 454,243 1,362,730

← Previous Integer #5,968,241 Browse Full Index Next Integer #5,968,243 →