5,934,258

2 × 3² × 11 × 17 × 41 × 43

5,934,258 factors as 2 × 3^2 × 11 × 17 × 41 × 43. Its 96 positive divisors give a proper-divisor sum of 9,633,294, so this integer is abundant. The Collatz stopping time is 95 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 11 × 17 × 41 × 43

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 15,567,552

Proper Divisor Sum 9,633,294

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #5934239 ← → #5934281

Radix Representation

Decimal	5934258
Binary	10110101000110010110010 (23 bits)
Octal	0o26506262
Hexadecimal	0x5A8CB2

Divisor Catalog (60 of 96)

1 2 3 6 9 11 17 18 22 33 34 41 43 51 66 82 86 99 102 123 129 153 187 198 246 258 306 369 374 387 451 473 561 697 731 738 774 902 946 1,122 1,353 1,394 1,419 1,462 1,683 1,763 2,091 2,193 2,706 2,838 3,366 3,526 4,059 4,182 4,257 4,386 5,289 6,273 6,579 7,667

Collatz Trajectory (95 steps to reach 1)

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

5,934,258 2,967,129 8,901,388 4,450,694 2,225,347 6,676,042 3,338,021 10,014,064 5,007,032 2,503,516 1,251,758 625,879 1,877,638 938,819 2,816,458 1,408,229 4,224,688 2,112,344 1,056,172 528,086 264,043 792,130 396,065 1,188,196 594,098 297,049 891,148 445,574 222,787 668,362 334,181 1,002,544 501,272 250,636 125,318 62,659 187,978 93,989 281,968 140,984 70,492 35,246 17,623 52,870 26,435 79,306 39,653 118,960 59,480 29,740 14,870 7,435 22,306 11,153 33,460 16,730 8,365 25,096 12,548 6,274

← Previous Integer #5,934,257 Browse Full Index Next Integer #5,934,259 →