9,217,836

2² × 3² × 107 × 2393

9,217,836 factors as 2^2 × 3^2 × 107 × 2393. Its 36 positive divisors give a proper-divisor sum of 14,310,396, so this integer is abundant. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 107 × 2393

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 23,528,232

Proper Divisor Sum 14,310,396

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #9217829 ← → #9217837

Radix Representation

Decimal	9217836
Binary	100011001010011100101100 (24 bits)
Octal	0o43123454
Hexadecimal	0x8CA72C

Divisor Catalog (36)

1 2 3 4 6 9 12 18 36 107 214 321 428 642 963 1,284 1,926 2,393 3,852 4,786 7,179 9,572 14,358 21,537 28,716 43,074 86,148 256,051 512,102 768,153 1,024,204 1,536,306 2,304,459 3,072,612 4,608,918 9,217,836

Collatz Trajectory (101 steps to reach 1)

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

9,217,836 4,608,918 2,304,459 6,913,378 3,456,689 10,370,068 5,185,034 2,592,517 7,777,552 3,888,776 1,944,388 972,194 486,097 1,458,292 729,146 364,573 1,093,720 546,860 273,430 136,715 410,146 205,073 615,220 307,610 153,805 461,416 230,708 115,354 57,677 173,032 86,516 43,258 21,629 64,888 32,444 16,222 8,111 24,334 12,167 36,502 18,251 54,754 27,377 82,132 41,066 20,533 61,600 30,800 15,400 7,700 3,850 1,925 5,776 2,888 1,444 722 361 1,084 542 271

← Previous Integer #9,217,835 Browse Full Index Next Integer #9,217,837 →