9,936,448

2⁶ × 107 × 1451

9,936,448 factors as 2^6 × 107 × 1451. Its 28 positive divisors give a proper-divisor sum of 9,979,184, so this integer is abundant. The Collatz stopping time is 145 steps.

Prime Factor Structure

Factorization String 2^6 × 107 × 1451

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 28

Divisor Sum (σ) 19,915,632

Proper Divisor Sum 9,979,184

Digit Sum / Digital Root 43 (Root: 7)

Adjacent Primes #9936439 ← → #9936457

Radix Representation

Decimal	9936448
Binary	100101111001111001000000 (24 bits)
Octal	0o45717100
Hexadecimal	0x979E40

Divisor Catalog (28)

1 2 4 8 16 32 64 107 214 428 856 1,451 1,712 2,902 3,424 5,804 6,848 11,608 23,216 46,432 92,864 155,257 310,514 621,028 1,242,056 2,484,112 4,968,224 9,936,448

Collatz Trajectory (145 steps to reach 1)

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

9,936,448 4,968,224 2,484,112 1,242,056 621,028 310,514 155,257 465,772 232,886 116,443 349,330 174,665 523,996 261,998 130,999 392,998 196,499 589,498 294,749 884,248 442,124 221,062 110,531 331,594 165,797 497,392 248,696 124,348 62,174 31,087 93,262 46,631 139,894 69,947 209,842 104,921 314,764 157,382 78,691 236,074 118,037 354,112 177,056 88,528 44,264 22,132 11,066 5,533 16,600 8,300 4,150 2,075 6,226 3,113 9,340 4,670 2,335 7,006 3,503 10,510

← Previous Integer #9,936,447 Browse Full Index Next Integer #9,936,449 →