3,319,960

2³ × 5 × 7 × 71 × 167

3,319,960 factors as 2^3 × 5 × 7 × 71 × 167. Its 64 positive divisors give a proper-divisor sum of 5,389,160, so this integer is abundant. The Collatz stopping time is 146 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 7 × 71 × 167

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 8,709,120

Proper Divisor Sum 5,389,160

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #3319957 ← → #3319963

Radix Representation

Decimal	3319960
Binary	1100101010100010011000 (22 bits)
Octal	0o14524230
Hexadecimal	0x32A898

Divisor Catalog (60 of 64)

1 2 4 5 7 8 10 14 20 28 35 40 56 70 71 140 142 167 280 284 334 355 497 568 668 710 835 994 1,169 1,336 1,420 1,670 1,988 2,338 2,485 2,840 3,340 3,976 4,676 4,970 5,845 6,680 9,352 9,940 11,690 11,857 19,880 23,380 23,714 46,760 47,428 59,285 82,999 94,856 118,570 165,998 237,140 331,996 414,995 474,280

Collatz Trajectory (146 steps to reach 1)

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

3,319,960 1,659,980 829,990 414,995 1,244,986 622,493 1,867,480 933,740 466,870 233,435 700,306 350,153 1,050,460 525,230 262,615 787,846 393,923 1,181,770 590,885 1,772,656 886,328 443,164 221,582 110,791 332,374 166,187 498,562 249,281 747,844 373,922 186,961 560,884 280,442 140,221 420,664 210,332 105,166 52,583 157,750 78,875 236,626 118,313 354,940 177,470 88,735 266,206 133,103 399,310 199,655 598,966 299,483 898,450 449,225 1,347,676 673,838 336,919 1,010,758 505,379 1,516,138 758,069

← Previous Integer #3,319,959 Browse Full Index Next Integer #3,319,961 →