3,316,980

2² × 3 × 5 × 59 × 937

3,316,980 factors as 2^2 × 3 × 5 × 59 × 937. Its 48 positive divisors give a proper-divisor sum of 6,138,060, so this integer is abundant. The Collatz stopping time is 164 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5 × 59 × 937

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 9,455,040

Proper Divisor Sum 6,138,060

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3316967 ← → #3316981

Radix Representation

Decimal	3316980
Binary	1100101001110011110100 (22 bits)
Octal	0o14516364
Hexadecimal	0x329CF4

Divisor Catalog (48)

1 2 3 4 5 6 10 12 15 20 30 59 60 118 177 236 295 354 590 708 885 937 1,180 1,770 1,874 2,811 3,540 3,748 4,685 5,622 9,370 11,244 14,055 18,740 28,110 55,283 56,220 110,566 165,849 221,132 276,415 331,698 552,830 663,396 829,245 1,105,660 1,658,490 3,316,980

Collatz Trajectory (164 steps to reach 1)

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

3,316,980 1,658,490 829,245 2,487,736 1,243,868 621,934 310,967 932,902 466,451 1,399,354 699,677 2,099,032 1,049,516 524,758 262,379 787,138 393,569 1,180,708 590,354 295,177 885,532 442,766 221,383 664,150 332,075 996,226 498,113 1,494,340 747,170 373,585 1,120,756 560,378 280,189 840,568 420,284 210,142 105,071 315,214 157,607 472,822 236,411 709,234 354,617 1,063,852 531,926 265,963 797,890 398,945 1,196,836 598,418 299,209 897,628 448,814 224,407 673,222 336,611 1,009,834 504,917 1,514,752 757,376

← Previous Integer #3,316,979 Browse Full Index Next Integer #3,316,981 →