9,105,104

2⁴ × 19 × 61 × 491

9,105,104 factors as 2^4 × 19 × 61 × 491. Its 40 positive divisors give a proper-divisor sum of 9,807,376, so this integer is abundant. The Collatz stopping time is 119 steps.

Prime Factor Structure

Factorization String 2^4 × 19 × 61 × 491

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 18,912,480

Proper Divisor Sum 9,807,376

Digit Sum / Digital Root 20 (Root: 2)

Adjacent Primes #9105077 ← → #9105113

Radix Representation

Decimal	9105104
Binary	100010101110111011010000 (24 bits)
Octal	0o42567320
Hexadecimal	0x8AEED0

Divisor Catalog (40)

1 2 4 8 16 19 38 61 76 122 152 244 304 488 491 976 982 1,159 1,964 2,318 3,928 4,636 7,856 9,272 9,329 18,544 18,658 29,951 37,316 59,902 74,632 119,804 149,264 239,608 479,216 569,069 1,138,138 2,276,276 4,552,552 9,105,104

Collatz Trajectory (119 steps to reach 1)

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

9,105,104 4,552,552 2,276,276 1,138,138 569,069 1,707,208 853,604 426,802 213,401 640,204 320,102 160,051 480,154 240,077 720,232 360,116 180,058 90,029 270,088 135,044 67,522 33,761 101,284 50,642 25,321 75,964 37,982 18,991 56,974 28,487 85,462 42,731 128,194 64,097 192,292 96,146 48,073 144,220 72,110 36,055 108,166 54,083 162,250 81,125 243,376 121,688 60,844 30,422 15,211 45,634 22,817 68,452 34,226 17,113 51,340 25,670 12,835 38,506 19,253 57,760

← Previous Integer #9,105,103 Browse Full Index Next Integer #9,105,105 →