3,200,238

2 × 3² × 177791

3,200,238 factors as 2 × 3^2 × 177791. Its 12 positive divisors give a proper-divisor sum of 3,733,650, so this integer is abundant. The Collatz stopping time is 58 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 177791

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 6,933,888

Proper Divisor Sum 3,733,650

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #3200213 ← → #3200251

Radix Representation

Decimal	3200238
Binary	1100001101010011101110 (22 bits)
Octal	0o14152356
Hexadecimal	0x30D4EE

Divisor Catalog (12)

1 2 3 6 9 18 177,791 355,582 533,373 1,066,746 1,600,119 3,200,238

Collatz Trajectory (58 steps to reach 1)

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

3,200,238 1,600,119 4,800,358 2,400,179 7,200,538 3,600,269 10,800,808 5,400,404 2,700,202 1,350,101 4,050,304 2,025,152 1,012,576 506,288 253,144 126,572 63,286 31,643 94,930 47,465 142,396 71,198 35,599 106,798 53,399 160,198 80,099 240,298 120,149 360,448 180,224 90,112 45,056 22,528 11,264 5,632 2,816 1,408 704 352 176 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

← Previous Integer #3,200,237 Browse Full Index Next Integer #3,200,239 →