9,727,188

2² × 3 × 163 × 4973

9,727,188 factors as 2^2 × 3 × 163 × 4973. Its 24 positive divisors give a proper-divisor sum of 13,113,420, so this integer is abundant. The Collatz stopping time is 62 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 163 × 4973

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 22,840,608

Proper Divisor Sum 13,113,420

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #9727187 ← → #9727199

Radix Representation

Decimal	9727188
Binary	100101000110110011010100 (24 bits)
Octal	0o45066324
Hexadecimal	0x946CD4

Divisor Catalog (24)

Collatz Trajectory (62 steps to reach 1)

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

9,727,188 4,863,594 2,431,797 7,295,392 3,647,696 1,823,848 911,924 455,962 227,981 683,944 341,972 170,986 85,493 256,480 128,240 64,120 32,060 16,030 8,015 24,046 12,023 36,070 18,035 54,106 27,053 81,160 40,580 20,290 10,145 30,436 15,218 7,609 22,828 11,414 5,707 17,122 8,561 25,684 12,842 6,421 19,264 9,632 4,816 2,408 1,204 602 301 904 452 226 113 340 170 85 256 128 64 32 16 8

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,727,187 Browse Full Index Next Integer #9,727,189 →