9,330,306

2 × 3 × 1555051

9,330,306 factors as 2 × 3 × 1555051. Its 8 positive divisors give a proper-divisor sum of 9,330,318, so this integer is abundant. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1555051

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 18,660,624

Proper Divisor Sum 9,330,318

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #9330289 ← → #9330337

Radix Representation

Decimal	9330306
Binary	100011100101111010000010 (24 bits)
Octal	0o43457202
Hexadecimal	0x8E5E82

Divisor Catalog (8)

1 2 3 6 1,555,051 3,110,102 4,665,153 9,330,306

Collatz Trajectory (132 steps to reach 1)

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

9,330,306 4,665,153 13,995,460 6,997,730 3,498,865 10,496,596 5,248,298 2,624,149 7,872,448 3,936,224 1,968,112 984,056 492,028 246,014 123,007 369,022 184,511 553,534 276,767 830,302 415,151 1,245,454 622,727 1,868,182 934,091 2,802,274 1,401,137 4,203,412 2,101,706 1,050,853 3,152,560 1,576,280 788,140 394,070 197,035 591,106 295,553 886,660 443,330 221,665 664,996 332,498 166,249 498,748 249,374 124,687 374,062 187,031 561,094 280,547 841,642 420,821 1,262,464 631,232 315,616 157,808 78,904 39,452 19,726 9,863

← Previous Integer #9,330,305 Browse Full Index Next Integer #9,330,307 →