5,968,302

2 × 3 × 994717

5,968,302 factors as 2 × 3 × 994717. Its 8 positive divisors give a proper-divisor sum of 5,968,314, so this integer is abundant. The Collatz stopping time is 214 steps.

Prime Factor Structure

Factorization String 2 × 3 × 994717

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 11,936,616

Proper Divisor Sum 5,968,314

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #5968279 ← → #5968307

Radix Representation

Decimal	5968302
Binary	10110110001000110101110 (23 bits)
Octal	0o26610656
Hexadecimal	0x5B11AE

Divisor Catalog (8)

1 2 3 6 994,717 1,989,434 2,984,151 5,968,302

Collatz Trajectory (214 steps to reach 1)

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

5,968,302 2,984,151 8,952,454 4,476,227 13,428,682 6,714,341 20,143,024 10,071,512 5,035,756 2,517,878 1,258,939 3,776,818 1,888,409 5,665,228 2,832,614 1,416,307 4,248,922 2,124,461 6,373,384 3,186,692 1,593,346 796,673 2,390,020 1,195,010 597,505 1,792,516 896,258 448,129 1,344,388 672,194 336,097 1,008,292 504,146 252,073 756,220 378,110 189,055 567,166 283,583 850,750 425,375 1,276,126 638,063 1,914,190 957,095 2,871,286 1,435,643 4,306,930 2,153,465 6,460,396 3,230,198 1,615,099 4,845,298 2,422,649 7,267,948 3,633,974 1,816,987 5,450,962 2,725,481 8,176,444

← Previous Integer #5,968,301 Browse Full Index Next Integer #5,968,303 →