3,293,028

2² × 3³ × 30491

3,293,028 factors as 2^2 × 3^3 × 30491. Its 24 positive divisors give a proper-divisor sum of 5,244,732, so this integer is abundant. The Collatz stopping time is 133 steps.

Prime Factor Structure

Factorization String 2^2 × 3^3 × 30491

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 8,537,760

Proper Divisor Sum 5,244,732

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #3293021 ← → #3293029

Radix Representation

Decimal	3293028
Binary	1100100011111101100100 (22 bits)
Octal	0o14437544
Hexadecimal	0x323F64

Divisor Catalog (24)

1 2 3 4 6 9 12 18 27 36 54 108 30,491 60,982 91,473 121,964 182,946 274,419 365,892 548,838 823,257 1,097,676 1,646,514 3,293,028

Collatz Trajectory (133 steps to reach 1)

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

3,293,028 1,646,514 823,257 2,469,772 1,234,886 617,443 1,852,330 926,165 2,778,496 1,389,248 694,624 347,312 173,656 86,828 43,414 21,707 65,122 32,561 97,684 48,842 24,421 73,264 36,632 18,316 9,158 4,579 13,738 6,869 20,608 10,304 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,293,027 Browse Full Index Next Integer #3,293,029 →