3,606,186

2 × 3 × 601031

3,606,186 factors as 2 × 3 × 601031. Its 8 positive divisors give a proper-divisor sum of 3,606,198, so this integer is abundant. The Collatz stopping time is 115 steps.

Prime Factor Structure

Factorization String 2 × 3 × 601031

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 7,212,384

Proper Divisor Sum 3,606,198

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3606167 ← → #3606209

Radix Representation

Decimal	3606186
Binary	1101110000011010101010 (22 bits)
Octal	0o15603252
Hexadecimal	0x3706AA

Divisor Catalog (8)

1 2 3 6 601,031 1,202,062 1,803,093 3,606,186

Collatz Trajectory (115 steps to reach 1)

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

3,606,186 1,803,093 5,409,280 2,704,640 1,352,320 676,160 338,080 169,040 84,520 42,260 21,130 10,565 31,696 15,848 7,924 3,962 1,981 5,944 2,972 1,486 743 2,230 1,115 3,346 1,673 5,020 2,510 1,255 3,766 1,883 5,650 2,825 8,476 4,238 2,119 6,358 3,179 9,538 4,769 14,308 7,154 3,577 10,732 5,366 2,683 8,050 4,025 12,076 6,038 3,019 9,058 4,529 13,588 6,794 3,397 10,192 5,096 2,548 1,274 637

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,606,185 Browse Full Index Next Integer #3,606,187 →