9,220,132

2² × 257 × 8969

9,220,132 factors as 2^2 × 257 × 8969. Its 12 positive divisors give a proper-divisor sum of 6,979,688, so this integer is deficient. The Collatz stopping time is 194 steps.

Prime Factor Structure

Factorization String 2^2 × 257 × 8969

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 16,199,820

Proper Divisor Sum 6,979,688

Digit Sum / Digital Root 19 (Root: 1)

Adjacent Primes #9220117 ← → #9220147

Radix Representation

Decimal	9220132
Binary	100011001011000000100100 (24 bits)
Octal	0o43130044
Hexadecimal	0x8CB024

Divisor Catalog (12)

1 2 4 257 514 1,028 8,969 17,938 35,876 2,305,033 4,610,066 9,220,132

Collatz Trajectory (194 steps to reach 1)

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

9,220,132 4,610,066 2,305,033 6,915,100 3,457,550 1,728,775 5,186,326 2,593,163 7,779,490 3,889,745 11,669,236 5,834,618 2,917,309 8,751,928 4,375,964 2,187,982 1,093,991 3,281,974 1,640,987 4,922,962 2,461,481 7,384,444 3,692,222 1,846,111 5,538,334 2,769,167 8,307,502 4,153,751 12,461,254 6,230,627 18,691,882 9,345,941 28,037,824 14,018,912 7,009,456 3,504,728 1,752,364 876,182 438,091 1,314,274 657,137 1,971,412 985,706 492,853 1,478,560 739,280 369,640 184,820 92,410 46,205 138,616 69,308 34,654 17,327 51,982 25,991 77,974 38,987 116,962 58,481

← Previous Integer #9,220,131 Browse Full Index Next Integer #9,220,133 →