9,928,110

2 × 3 × 5 × 199 × 1663

9,928,110 factors as 2 × 3 × 5 × 199 × 1663. Its 32 positive divisors give a proper-divisor sum of 14,033,490, so this integer is abundant. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 199 × 1663

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 23,961,600

Proper Divisor Sum 14,033,490

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #9928081 ← → #9928129

Radix Representation

Decimal	9928110
Binary	100101110111110110101110 (24 bits)
Octal	0o45676656
Hexadecimal	0x977DAE

Divisor Catalog (32)

1 2 3 5 6 10 15 30 199 398 597 995 1,194 1,663 1,990 2,985 3,326 4,989 5,970 8,315 9,978 16,630 24,945 49,890 330,937 661,874 992,811 1,654,685 1,985,622 3,309,370 4,964,055 9,928,110

Collatz Trajectory (132 steps to reach 1)

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

9,928,110 4,964,055 14,892,166 7,446,083 22,338,250 11,169,125 33,507,376 16,753,688 8,376,844 4,188,422 2,094,211 6,282,634 3,141,317 9,423,952 4,711,976 2,355,988 1,177,994 588,997 1,766,992 883,496 441,748 220,874 110,437 331,312 165,656 82,828 41,414 20,707 62,122 31,061 93,184 46,592 23,296 11,648 5,824 2,912 1,456 728 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175 526 263 790 395 1,186 593 1,780

← Previous Integer #9,928,109 Browse Full Index Next Integer #9,928,111 →