9,110,992

2⁴ × 11 × 51767

9,110,992 factors as 2^4 × 11 × 51767. Its 20 positive divisors give a proper-divisor sum of 10,146,704, so this integer is abundant. The Collatz stopping time is 181 steps.

Prime Factor Structure

Factorization String 2^4 × 11 × 51767

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 19,257,696

Proper Divisor Sum 10,146,704

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #9110989 ← → #9111001

Radix Representation

Decimal	9110992
Binary	100010110000010111010000 (24 bits)
Octal	0o42602720
Hexadecimal	0x8B05D0

Divisor Catalog (20)

Collatz Trajectory (181 steps to reach 1)

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

9,110,992 4,555,496 2,277,748 1,138,874 569,437 1,708,312 854,156 427,078 213,539 640,618 320,309 960,928 480,464 240,232 120,116 60,058 30,029 90,088 45,044 22,522 11,261 33,784 16,892 8,446 4,223 12,670 6,335 19,006 9,503 28,510 14,255 42,766 21,383 64,150 32,075 96,226 48,113 144,340 72,170 36,085 108,256 54,128 27,064 13,532 6,766 3,383 10,150 5,075 15,226 7,613 22,840 11,420 5,710 2,855 8,566 4,283 12,850 6,425 19,276 9,638

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,110,991 Browse Full Index Next Integer #9,110,993 →