3,292,584

2³ × 3 × 137191

3,292,584 factors as 2^3 × 3 × 137191. Its 16 positive divisors give a proper-divisor sum of 4,938,936, so this integer is abundant. The Collatz stopping time is 133 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 137191

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,231,520

Proper Divisor Sum 4,938,936

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3292579 ← → #3292589

Radix Representation

Decimal	3292584
Binary	1100100011110110101000 (22 bits)
Octal	0o14436650
Hexadecimal	0x323DA8

Divisor Catalog (16)

1 2 3 4 6 8 12 24 137,191 274,382 411,573 548,764 823,146 1,097,528 1,646,292 3,292,584

Collatz Trajectory (133 steps to reach 1)

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

3,292,584 1,646,292 823,146 411,573 1,234,720 617,360 308,680 154,340 77,170 38,585 115,756 57,878 28,939 86,818 43,409 130,228 65,114 32,557 97,672 48,836 24,418 12,209 36,628 18,314 9,157 27,472 13,736 6,868 3,434 1,717 5,152 2,576 1,288 644 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175 526 263 790 395 1,186 593

← Previous Integer #3,292,583 Browse Full Index Next Integer #3,292,585 →