5,978,466

2 × 3² × 13 × 29 × 881

5,978,466 factors as 2 × 3^2 × 13 × 29 × 881. Its 48 positive divisors give a proper-divisor sum of 8,468,694, so this integer is abundant. The Collatz stopping time is 90 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 13 × 29 × 881

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 14,447,160

Proper Divisor Sum 8,468,694

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #5978461 ← → #5978471

Radix Representation

Decimal	5978466
Binary	10110110011100101100010 (23 bits)
Octal	0o26634542
Hexadecimal	0x5B3962

Divisor Catalog (48)

1 2 3 6 9 13 18 26 29 39 58 78 87 117 174 234 261 377 522 754 881 1,131 1,762 2,262 2,643 3,393 5,286 6,786 7,929 11,453 15,858 22,906 25,549 34,359 51,098 68,718 76,647 103,077 153,294 206,154 229,941 332,137 459,882 664,274 996,411 1,992,822 2,989,233 5,978,466

Collatz Trajectory (90 steps to reach 1)

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

5,978,466 2,989,233 8,967,700 4,483,850 2,241,925 6,725,776 3,362,888 1,681,444 840,722 420,361 1,261,084 630,542 315,271 945,814 472,907 1,418,722 709,361 2,128,084 1,064,042 532,021 1,596,064 798,032 399,016 199,508 99,754 49,877 149,632 74,816 37,408 18,704 9,352 4,676 2,338 1,169 3,508 1,754 877 2,632 1,316 658 329 988 494 247 742 371 1,114 557 1,672 836 418 209 628 314 157 472 236 118 59 178

← Previous Integer #5,978,465 Browse Full Index Next Integer #5,978,467 →