9,986,032

2⁴ × 7 × 163 × 547

9,986,032 factors as 2^4 × 7 × 163 × 547. Its 40 positive divisors give a proper-divisor sum of 12,302,224, so this integer is abundant. The Collatz stopping time is 207 steps.

Prime Factor Structure

Factorization String 2^4 × 7 × 163 × 547

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 22,288,256

Proper Divisor Sum 12,302,224

Digit Sum / Digital Root 37 (Root: 1)

Adjacent Primes #9986029 ← → #9986033

Radix Representation

Decimal	9986032
Binary	100110000101111111110000 (24 bits)
Octal	0o46057760
Hexadecimal	0x985FF0

Divisor Catalog (40)

1 2 4 7 8 14 16 28 56 112 163 326 547 652 1,094 1,141 1,304 2,188 2,282 2,608 3,829 4,376 4,564 7,658 8,752 9,128 15,316 18,256 30,632 61,264 89,161 178,322 356,644 624,127 713,288 1,248,254 1,426,576 2,496,508 4,993,016 9,986,032

Collatz Trajectory (207 steps to reach 1)

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

9,986,032 4,993,016 2,496,508 1,248,254 624,127 1,872,382 936,191 2,808,574 1,404,287 4,212,862 2,106,431 6,319,294 3,159,647 9,478,942 4,739,471 14,218,414 7,109,207 21,327,622 10,663,811 31,991,434 15,995,717 47,987,152 23,993,576 11,996,788 5,998,394 2,999,197 8,997,592 4,498,796 2,249,398 1,124,699 3,374,098 1,687,049 5,061,148 2,530,574 1,265,287 3,795,862 1,897,931 5,693,794 2,846,897 8,540,692 4,270,346 2,135,173 6,405,520 3,202,760 1,601,380 800,690 400,345 1,201,036 600,518 300,259 900,778 450,389 1,351,168 675,584 337,792 168,896 84,448 42,224 21,112 10,556

← Previous Integer #9,986,031 Browse Full Index Next Integer #9,986,033 →