3,322,860

2² × 3 × 5 × 55381

3,322,860 factors as 2^2 × 3 × 5 × 55381. Its 24 positive divisors give a proper-divisor sum of 5,981,316, so this integer is abundant. The Collatz stopping time is 138 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5 × 55381

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 9,304,176

Proper Divisor Sum 5,981,316

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #3322843 ← → #3322861

Radix Representation

Decimal	3322860
Binary	1100101011001111101100 (22 bits)
Octal	0o14531754
Hexadecimal	0x32B3EC

Divisor Catalog (24)

1 2 3 4 5 6 10 12 15 20 30 60 55,381 110,762 166,143 221,524 276,905 332,286 553,810 664,572 830,715 1,107,620 1,661,430 3,322,860

Collatz Trajectory (138 steps to reach 1)

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

3,322,860 1,661,430 830,715 2,492,146 1,246,073 3,738,220 1,869,110 934,555 2,803,666 1,401,833 4,205,500 2,102,750 1,051,375 3,154,126 1,577,063 4,731,190 2,365,595 7,096,786 3,548,393 10,645,180 5,322,590 2,661,295 7,983,886 3,991,943 11,975,830 5,987,915 17,963,746 8,981,873 26,945,620 13,472,810 6,736,405 20,209,216 10,104,608 5,052,304 2,526,152 1,263,076 631,538 315,769 947,308 473,654 236,827 710,482 355,241 1,065,724 532,862 266,431 799,294 399,647 1,198,942 599,471 1,798,414 899,207 2,697,622 1,348,811 4,046,434 2,023,217 6,069,652 3,034,826 1,517,413 4,552,240

← Previous Integer #3,322,859 Browse Full Index Next Integer #3,322,861 →