5,983,944

2³ × 3 × 167 × 1493

5,983,944 factors as 2^3 × 3 × 167 × 1493. Its 32 positive divisors give a proper-divisor sum of 9,075,576, so this integer is abundant. The Collatz stopping time is 90 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 167 × 1493

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 15,059,520

Proper Divisor Sum 9,075,576

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #5983931 ← → #5983969

Radix Representation

Decimal	5983944
Binary	10110110100111011001000 (23 bits)
Octal	0o26647310
Hexadecimal	0x5B4EC8

Divisor Catalog (32)

1 2 3 4 6 8 12 24 167 334 501 668 1,002 1,336 1,493 2,004 2,986 4,008 4,479 5,972 8,958 11,944 17,916 35,832 249,331 498,662 747,993 997,324 1,495,986 1,994,648 2,991,972 5,983,944

Collatz Trajectory (90 steps to reach 1)

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

5,983,944 2,991,972 1,495,986 747,993 2,243,980 1,121,990 560,995 1,682,986 841,493 2,524,480 1,262,240 631,120 315,560 157,780 78,890 39,445 118,336 59,168 29,584 14,792 7,396 3,698 1,849 5,548 2,774 1,387 4,162 2,081 6,244 3,122 1,561 4,684 2,342 1,171 3,514 1,757 5,272 2,636 1,318 659 1,978 989 2,968 1,484 742 371 1,114 557 1,672 836 418 209 628 314 157 472 236 118 59 178

← Previous Integer #5,983,943 Browse Full Index Next Integer #5,983,945 →