9,982,248

2³ × 3 × 31 × 13417

9,982,248 factors as 2^3 × 3 × 31 × 13417. Its 32 positive divisors give a proper-divisor sum of 15,780,312, so this integer is abundant. The Collatz stopping time is 282 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 31 × 13417

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 25,762,560

Proper Divisor Sum 15,780,312

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #9982243 ← → #9982303

Radix Representation

Decimal	9982248
Binary	100110000101000100101000 (24 bits)
Octal	0o46050450
Hexadecimal	0x985128

Divisor Catalog (32)

1 2 3 4 6 8 12 24 31 62 93 124 186 248 372 744 13,417 26,834 40,251 53,668 80,502 107,336 161,004 322,008 415,927 831,854 1,247,781 1,663,708 2,495,562 3,327,416 4,991,124 9,982,248

Collatz Trajectory (282 steps to reach 1)

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

9,982,248 4,991,124 2,495,562 1,247,781 3,743,344 1,871,672 935,836 467,918 233,959 701,878 350,939 1,052,818 526,409 1,579,228 789,614 394,807 1,184,422 592,211 1,776,634 888,317 2,664,952 1,332,476 666,238 333,119 999,358 499,679 1,499,038 749,519 2,248,558 1,124,279 3,372,838 1,686,419 5,059,258 2,529,629 7,588,888 3,794,444 1,897,222 948,611 2,845,834 1,422,917 4,268,752 2,134,376 1,067,188 533,594 266,797 800,392 400,196 200,098 100,049 300,148 150,074 75,037 225,112 112,556 56,278 28,139 84,418 42,209 126,628 63,314

← Previous Integer #9,982,247 Browse Full Index Next Integer #9,982,249 →