9,586,920

2³ × 3 × 5 × 7 × 101 × 113

9,586,920 factors as 2^3 × 3 × 5 × 7 × 101 × 113. Its 128 positive divisors give a proper-divisor sum of 23,901,720, so this integer is abundant. The Collatz stopping time is 93 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 5 × 7 × 101 × 113

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 128

Divisor Sum (σ) 33,488,640

Proper Divisor Sum 23,901,720

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9586909 ← → #9586933

Radix Representation

Decimal	9586920
Binary	100100100100100011101000 (24 bits)
Octal	0o44444350
Hexadecimal	0x9248E8

Divisor Catalog (60 of 128)

1 2 3 4 5 6 7 8 10 12 14 15 20 21 24 28 30 35 40 42 56 60 70 84 101 105 113 120 140 168 202 210 226 280 303 339 404 420 452 505 565 606 678 707 791 808 840 904 1,010 1,130 1,212 1,356 1,414 1,515 1,582 1,695 2,020 2,121 2,260 2,373

Collatz Trajectory (93 steps to reach 1)

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

9,586,920 4,793,460 2,396,730 1,198,365 3,595,096 1,797,548 898,774 449,387 1,348,162 674,081 2,022,244 1,011,122 505,561 1,516,684 758,342 379,171 1,137,514 568,757 1,706,272 853,136 426,568 213,284 106,642 53,321 159,964 79,982 39,991 119,974 59,987 179,962 89,981 269,944 134,972 67,486 33,743 101,230 50,615 151,846 75,923 227,770 113,885 341,656 170,828 85,414 42,707 128,122 64,061 192,184 96,092 48,046 24,023 72,070 36,035 108,106 54,053 162,160 81,080 40,540 20,270 10,135

← Previous Integer #9,586,919 Browse Full Index Next Integer #9,586,921 →