9,108,932

2² × 7 × 325319

9,108,932 factors as 2^2 × 7 × 325319. Its 12 positive divisors give a proper-divisor sum of 9,108,988, so this integer is abundant. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 325319

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 18,217,920

Proper Divisor Sum 9,108,988

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #9108917 ← → #9108941

Radix Representation

Decimal	9108932
Binary	100010101111110111000100 (24 bits)
Octal	0o42576704
Hexadecimal	0x8AFDC4

Divisor Catalog (12)

1 2 4 7 14 28 325,319 650,638 1,301,276 2,277,233 4,554,466 9,108,932

Collatz Trajectory (132 steps to reach 1)

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

9,108,932 4,554,466 2,277,233 6,831,700 3,415,850 1,707,925 5,123,776 2,561,888 1,280,944 640,472 320,236 160,118 80,059 240,178 120,089 360,268 180,134 90,067 270,202 135,101 405,304 202,652 101,326 50,663 151,990 75,995 227,986 113,993 341,980 170,990 85,495 256,486 128,243 384,730 192,365 577,096 288,548 144,274 72,137 216,412 108,206 54,103 162,310 81,155 243,466 121,733 365,200 182,600 91,300 45,650 22,825 68,476 34,238 17,119 51,358 25,679 77,038 38,519 115,558 57,779

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,108,931 Browse Full Index Next Integer #9,108,933 →