9,237,976

2³ × 11 × 113 × 929

9,237,976 factors as 2^3 × 11 × 113 × 929. Its 32 positive divisors give a proper-divisor sum of 9,845,624, so this integer is abundant. The Collatz stopping time is 75 steps.

Prime Factor Structure

Factorization String 2^3 × 11 × 113 × 929

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 19,083,600

Proper Divisor Sum 9,845,624

Digit Sum / Digital Root 43 (Root: 7)

Adjacent Primes #9237961 ← → #9238001

Radix Representation

Decimal	9237976
Binary	100011001111010111011000 (24 bits)
Octal	0o43172730
Hexadecimal	0x8CF5D8

Divisor Catalog (32)

1 2 4 8 11 22 44 88 113 226 452 904 929 1,243 1,858 2,486 3,716 4,972 7,432 9,944 10,219 20,438 40,876 81,752 104,977 209,954 419,908 839,816 1,154,747 2,309,494 4,618,988 9,237,976

Collatz Trajectory (75 steps to reach 1)

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

9,237,976 4,618,988 2,309,494 1,154,747 3,464,242 1,732,121 5,196,364 2,598,182 1,299,091 3,897,274 1,948,637 5,845,912 2,922,956 1,461,478 730,739 2,192,218 1,096,109 3,288,328 1,644,164 822,082 411,041 1,233,124 616,562 308,281 924,844 462,422 231,211 693,634 346,817 1,040,452 520,226 260,113 780,340 390,170 195,085 585,256 292,628 146,314 73,157 219,472 109,736 54,868 27,434 13,717 41,152 20,576 10,288 5,144 2,572 1,286 643 1,930 965 2,896 1,448 724 362 181 544 272

← Previous Integer #9,237,975 Browse Full Index Next Integer #9,237,977 →