9,202,686

2 × 3 × 29 × 52889

9,202,686 factors as 2 × 3 × 29 × 52889. Its 16 positive divisors give a proper-divisor sum of 9,837,714, so this integer is abundant. The Collatz stopping time is 150 steps.

Prime Factor Structure

Factorization String 2 × 3 × 29 × 52889

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 19,040,400

Proper Divisor Sum 9,837,714

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #9202679 ← → #9202693

Radix Representation

Decimal	9202686
Binary	100011000110101111111110 (24 bits)
Octal	0o43065776
Hexadecimal	0x8C6BFE

Divisor Catalog (16)

1 2 3 6 29 58 87 174 52,889 105,778 158,667 317,334 1,533,781 3,067,562 4,601,343 9,202,686

Collatz Trajectory (150 steps to reach 1)

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

9,202,686 4,601,343 13,804,030 6,902,015 20,706,046 10,353,023 31,059,070 15,529,535 46,588,606 23,294,303 69,882,910 34,941,455 104,824,366 52,412,183 157,236,550 78,618,275 235,854,826 117,927,413 353,782,240 176,891,120 88,445,560 44,222,780 22,111,390 11,055,695 33,167,086 16,583,543 49,750,630 24,875,315 74,625,946 37,312,973 111,938,920 55,969,460 27,984,730 13,992,365 41,977,096 20,988,548 10,494,274 5,247,137 15,741,412 7,870,706 3,935,353 11,806,060 5,903,030 2,951,515 8,854,546 4,427,273 13,281,820 6,640,910 3,320,455 9,961,366 4,980,683 14,942,050 7,471,025 22,413,076 11,206,538 5,603,269 16,809,808 8,404,904 4,202,452 2,101,226

← Previous Integer #9,202,685 Browse Full Index Next Integer #9,202,687 →