9,627,104

2⁵ × 37 × 47 × 173

9,627,104 factors as 2^5 × 37 × 47 × 173. Its 48 positive divisors give a proper-divisor sum of 10,367,584, so this integer is abundant. The Collatz stopping time is 145 steps.

Prime Factor Structure

Factorization String 2^5 × 37 × 47 × 173

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 19,994,688

Proper Divisor Sum 10,367,584

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #9627097 ← → #9627109

Radix Representation

Decimal	9627104
Binary	100100101110010111100000 (24 bits)
Octal	0o44562740
Hexadecimal	0x92E5E0

Divisor Catalog (48)

1 2 4 8 16 32 37 47 74 94 148 173 188 296 346 376 592 692 752 1,184 1,384 1,504 1,739 2,768 3,478 5,536 6,401 6,956 8,131 12,802 13,912 16,262 25,604 27,824 32,524 51,208 55,648 65,048 102,416 130,096 204,832 260,192 300,847 601,694 1,203,388 2,406,776 4,813,552 9,627,104

Collatz Trajectory (145 steps to reach 1)

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

9,627,104 4,813,552 2,406,776 1,203,388 601,694 300,847 902,542 451,271 1,353,814 676,907 2,030,722 1,015,361 3,046,084 1,523,042 761,521 2,284,564 1,142,282 571,141 1,713,424 856,712 428,356 214,178 107,089 321,268 160,634 80,317 240,952 120,476 60,238 30,119 90,358 45,179 135,538 67,769 203,308 101,654 50,827 152,482 76,241 228,724 114,362 57,181 171,544 85,772 42,886 21,443 64,330 32,165 96,496 48,248 24,124 12,062 6,031 18,094 9,047 27,142 13,571 40,714 20,357 61,072

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