3,986,320

2⁴ × 5 × 13 × 3833

3,986,320 factors as 2^4 × 5 × 13 × 3833. Its 40 positive divisors give a proper-divisor sum of 5,997,416, so this integer is abundant. The Collatz stopping time is 216 steps.

Prime Factor Structure

Factorization String 2^4 × 5 × 13 × 3833

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 9,983,736

Proper Divisor Sum 5,997,416

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #3986309 ← → #3986329

Radix Representation

Decimal	3986320
Binary	1111001101001110010000 (22 bits)
Octal	0o17151620
Hexadecimal	0x3CD390

Divisor Catalog (40)

1 2 4 5 8 10 13 16 20 26 40 52 65 80 104 130 208 260 520 1,040 3,833 7,666 15,332 19,165 30,664 38,330 49,829 61,328 76,660 99,658 153,320 199,316 249,145 306,640 398,632 498,290 797,264 996,580 1,993,160 3,986,320

Collatz Trajectory (216 steps to reach 1)

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

3,986,320 1,993,160 996,580 498,290 249,145 747,436 373,718 186,859 560,578 280,289 840,868 420,434 210,217 630,652 315,326 157,663 472,990 236,495 709,486 354,743 1,064,230 532,115 1,596,346 798,173 2,394,520 1,197,260 598,630 299,315 897,946 448,973 1,346,920 673,460 336,730 168,365 505,096 252,548 126,274 63,137 189,412 94,706 47,353 142,060 71,030 35,515 106,546 53,273 159,820 79,910 39,955 119,866 59,933 179,800 89,900 44,950 22,475 67,426 33,713 101,140 50,570 25,285

← Previous Integer #3,986,319 Browse Full Index Next Integer #3,986,321 →