9,109,956

2² × 3 × 293 × 2591

9,109,956 factors as 2^2 × 3 × 293 × 2591. Its 24 positive divisors give a proper-divisor sum of 12,227,388, so this integer is abundant. The Collatz stopping time is 181 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 293 × 2591

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 21,337,344

Proper Divisor Sum 12,227,388

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9109927 ← → #9109957

Radix Representation

Decimal	9109956
Binary	100010110000000111000100 (24 bits)
Octal	0o42600704
Hexadecimal	0x8B01C4

Divisor Catalog (24)

Collatz Trajectory (181 steps to reach 1)

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

9,109,956 4,554,978 2,277,489 6,832,468 3,416,234 1,708,117 5,124,352 2,562,176 1,281,088 640,544 320,272 160,136 80,068 40,034 20,017 60,052 30,026 15,013 45,040 22,520 11,260 5,630 2,815 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,109,955 Browse Full Index Next Integer #9,109,957 →