9,634,686

2 × 3 × 73 × 21997

9,634,686 factors as 2 × 3 × 73 × 21997. Its 16 positive divisors give a proper-divisor sum of 9,899,538, so this integer is abundant. The Collatz stopping time is 207 steps.

Prime Factor Structure

Factorization String 2 × 3 × 73 × 21997

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 19,534,224

Proper Divisor Sum 9,899,538

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #9634663 ← → #9634697

Radix Representation

Decimal	9634686
Binary	100100110000001101111110 (24 bits)
Octal	0o44601576
Hexadecimal	0x93037E

Divisor Catalog (16)

1 2 3 6 73 146 219 438 21,997 43,994 65,991 131,982 1,605,781 3,211,562 4,817,343 9,634,686

Collatz Trajectory (207 steps to reach 1)

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

9,634,686 4,817,343 14,452,030 7,226,015 21,678,046 10,839,023 32,517,070 16,258,535 48,775,606 24,387,803 73,163,410 36,581,705 109,745,116 54,872,558 27,436,279 82,308,838 41,154,419 123,463,258 61,731,629 185,194,888 92,597,444 46,298,722 23,149,361 69,448,084 34,724,042 17,362,021 52,086,064 26,043,032 13,021,516 6,510,758 3,255,379 9,766,138 4,883,069 14,649,208 7,324,604 3,662,302 1,831,151 5,493,454 2,746,727 8,240,182 4,120,091 12,360,274 6,180,137 18,540,412 9,270,206 4,635,103 13,905,310 6,952,655 20,857,966 10,428,983 31,286,950 15,643,475 46,930,426 23,465,213 70,395,640 35,197,820 17,598,910 8,799,455 26,398,366 13,199,183

← Previous Integer #9,634,685 Browse Full Index Next Integer #9,634,687 →