9,850,566

2 × 3 × 11 × 149251

9,850,566 factors as 2 × 3 × 11 × 149251. Its 16 positive divisors give a proper-divisor sum of 11,641,722, so this integer is abundant. The Collatz stopping time is 176 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 149251

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 21,492,288

Proper Divisor Sum 11,641,722

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9850559 ← → #9850567

Radix Representation

Decimal	9850566
Binary	100101100100111011000110 (24 bits)
Octal	0o45447306
Hexadecimal	0x964EC6

Divisor Catalog (16)

1 2 3 6 11 22 33 66 149,251 298,502 447,753 895,506 1,641,761 3,283,522 4,925,283 9,850,566

Collatz Trajectory (176 steps to reach 1)

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

9,850,566 4,925,283 14,775,850 7,387,925 22,163,776 11,081,888 5,540,944 2,770,472 1,385,236 692,618 346,309 1,038,928 519,464 259,732 129,866 64,933 194,800 97,400 48,700 24,350 12,175 36,526 18,263 54,790 27,395 82,186 41,093 123,280 61,640 30,820 15,410 7,705 23,116 11,558 5,779 17,338 8,669 26,008 13,004 6,502 3,251 9,754 4,877 14,632 7,316 3,658 1,829 5,488 2,744 1,372 686 343 1,030 515 1,546 773 2,320 1,160 580 290

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,850,565 Browse Full Index Next Integer #9,850,567 →