9,917,776

2⁴ × 11 × 37 × 1523

9,917,776 factors as 2^4 × 11 × 37 × 1523. Its 40 positive divisors give a proper-divisor sum of 11,625,488, so this integer is abundant. The Collatz stopping time is 31 steps.

Prime Factor Structure

Factorization String 2^4 × 11 × 37 × 1523

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 21,543,264

Proper Divisor Sum 11,625,488

Digit Sum / Digital Root 46 (Root: 1)

Adjacent Primes #9917771 ← → #9917779

Radix Representation

Decimal	9917776
Binary	100101110101010101010000 (24 bits)
Octal	0o45652520
Hexadecimal	0x975550

Divisor Catalog (40)

1 2 4 8 11 16 22 37 44 74 88 148 176 296 407 592 814 1,523 1,628 3,046 3,256 6,092 6,512 12,184 16,753 24,368 33,506 56,351 67,012 112,702 134,024 225,404 268,048 450,808 619,861 901,616 1,239,722 2,479,444 4,958,888 9,917,776

Collatz Trajectory (31 steps to reach 1)

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

9,917,776 4,958,888 2,479,444 1,239,722 619,861 1,859,584 929,792 464,896 232,448 116,224 58,112 29,056 14,528 7,264 3,632 1,816 908 454 227 682 341 1,024 512 256 128 64 32 16 8 4 2 1

← Previous Integer #9,917,775 Browse Full Index Next Integer #9,917,777 →