9,961,568

2⁵ × 311299

9,961,568 factors as 2^5 × 311299. Its 12 positive divisors give a proper-divisor sum of 9,650,332, so this integer is deficient. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2^5 × 311299

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 19,611,900

Proper Divisor Sum 9,650,332

Digit Sum / Digital Root 44 (Root: 8)

Adjacent Primes #9961543 ← → #9961573

Radix Representation

Decimal	9961568
Binary	100110000000000001100000 (24 bits)
Octal	0o46000140
Hexadecimal	0x980060

Divisor Catalog (12)

1 2 4 8 16 32 311,299 622,598 1,245,196 2,490,392 4,980,784 9,961,568

Collatz Trajectory (101 steps to reach 1)

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

9,961,568 4,980,784 2,490,392 1,245,196 622,598 311,299 933,898 466,949 1,400,848 700,424 350,212 175,106 87,553 262,660 131,330 65,665 196,996 98,498 49,249 147,748 73,874 36,937 110,812 55,406 27,703 83,110 41,555 124,666 62,333 187,000 93,500 46,750 23,375 70,126 35,063 105,190 52,595 157,786 78,893 236,680 118,340 59,170 29,585 88,756 44,378 22,189 66,568 33,284 16,642 8,321 24,964 12,482 6,241 18,724 9,362 4,681 14,044 7,022 3,511 10,534

← Previous Integer #9,961,567 Browse Full Index Next Integer #9,961,569 →