5,955,880

2³ × 5 × 7 × 89 × 239

5,955,880 factors as 2^3 × 5 × 7 × 89 × 239. Its 64 positive divisors give a proper-divisor sum of 9,596,120, so this integer is abundant. The Collatz stopping time is 121 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 7 × 89 × 239

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 15,552,000

Proper Divisor Sum 9,596,120

Digit Sum / Digital Root 40 (Root: 4)

Adjacent Primes #5955877 ← → #5955883

Radix Representation

Decimal	5955880
Binary	10110101110000100101000 (23 bits)
Octal	0o26560450
Hexadecimal	0x5AE128

Divisor Catalog (60 of 64)

1 2 4 5 7 8 10 14 20 28 35 40 56 70 89 140 178 239 280 356 445 478 623 712 890 956 1,195 1,246 1,673 1,780 1,912 2,390 2,492 3,115 3,346 3,560 4,780 4,984 6,230 6,692 8,365 9,560 12,460 13,384 16,730 21,271 24,920 33,460 42,542 66,920 85,084 106,355 148,897 170,168 212,710 297,794 425,420 595,588 744,485 850,840

Collatz Trajectory (121 steps to reach 1)

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

5,955,880 2,977,940 1,488,970 744,485 2,233,456 1,116,728 558,364 279,182 139,591 418,774 209,387 628,162 314,081 942,244 471,122 235,561 706,684 353,342 176,671 530,014 265,007 795,022 397,511 1,192,534 596,267 1,788,802 894,401 2,683,204 1,341,602 670,801 2,012,404 1,006,202 503,101 1,509,304 754,652 377,326 188,663 565,990 282,995 848,986 424,493 1,273,480 636,740 318,370 159,185 477,556 238,778 119,389 358,168 179,084 89,542 44,771 134,314 67,157 201,472 100,736 50,368 25,184 12,592 6,296

← Previous Integer #5,955,879 Browse Full Index Next Integer #5,955,881 →