9,857,766

2 × 3 × 263 × 6247

9,857,766 factors as 2 × 3 × 263 × 6247. Its 16 positive divisors give a proper-divisor sum of 9,935,898, so this integer is abundant. The Collatz stopping time is 83 steps.

Prime Factor Structure

Factorization String 2 × 3 × 263 × 6247

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 19,793,664

Proper Divisor Sum 9,935,898

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #9857737 ← → #9857791

Radix Representation

Decimal	9857766
Binary	100101100110101011100110 (24 bits)
Octal	0o45465346
Hexadecimal	0x966AE6

Divisor Catalog (16)

1 2 3 6 263 526 789 1,578 6,247 12,494 18,741 37,482 1,642,961 3,285,922 4,928,883 9,857,766

Collatz Trajectory (83 steps to reach 1)

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

9,857,766 4,928,883 14,786,650 7,393,325 22,179,976 11,089,988 5,544,994 2,772,497 8,317,492 4,158,746 2,079,373 6,238,120 3,119,060 1,559,530 779,765 2,339,296 1,169,648 584,824 292,412 146,206 73,103 219,310 109,655 328,966 164,483 493,450 246,725 740,176 370,088 185,044 92,522 46,261 138,784 69,392 34,696 17,348 8,674 4,337 13,012 6,506 3,253 9,760 4,880 2,440 1,220 610 305 916 458 229 688 344 172 86 43 130 65 196 98 49

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,857,765 Browse Full Index Next Integer #9,857,767 →