9,630,582

2 × 3 × 13 × 37 × 47 × 71

9,630,582 factors as 2 × 3 × 13 × 37 × 47 × 71. Its 64 positive divisors give a proper-divisor sum of 12,432,522, so this integer is abundant. The Collatz stopping time is 145 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 37 × 47 × 71

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 22,063,104

Proper Divisor Sum 12,432,522

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #9630559 ← → #9630611

Radix Representation

Decimal	9630582
Binary	100100101111001101110110 (24 bits)
Octal	0o44571566
Hexadecimal	0x92F376

Divisor Catalog (60 of 64)

1 2 3 6 13 26 37 39 47 71 74 78 94 111 141 142 213 222 282 426 481 611 923 962 1,222 1,443 1,739 1,833 1,846 2,627 2,769 2,886 3,337 3,478 3,666 5,217 5,254 5,538 6,674 7,881 10,011 10,434 15,762 20,022 22,607 34,151 43,381 45,214 67,821 68,302 86,762 102,453 123,469 130,143 135,642 204,906 246,938 260,286 370,407 740,814

Collatz Trajectory (145 steps to reach 1)

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

9,630,582 4,815,291 14,445,874 7,222,937 21,668,812 10,834,406 5,417,203 16,251,610 8,125,805 24,377,416 12,188,708 6,094,354 3,047,177 9,141,532 4,570,766 2,285,383 6,856,150 3,428,075 10,284,226 5,142,113 15,426,340 7,713,170 3,856,585 11,569,756 5,784,878 2,892,439 8,677,318 4,338,659 13,015,978 6,507,989 19,523,968 9,761,984 4,880,992 2,440,496 1,220,248 610,124 305,062 152,531 457,594 228,797 686,392 343,196 171,598 85,799 257,398 128,699 386,098 193,049 579,148 289,574 144,787 434,362 217,181 651,544 325,772 162,886 81,443 244,330 122,165 366,496

← Previous Integer #9,630,581 Browse Full Index Next Integer #9,630,583 →