2,167,986

2 × 3 × 67 × 5393

2,167,986 factors as 2 × 3 × 67 × 5393. Its 16 positive divisors give a proper-divisor sum of 2,233,518, so this integer is abundant. The Collatz stopping time is 148 steps.

Prime Factor Structure

Factorization String 2 × 3 × 67 × 5393

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,401,504

Proper Divisor Sum 2,233,518

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #2167973 ← → #2167987

Radix Representation

Decimal	2167986
Binary	1000010001010010110010 (22 bits)
Octal	0o10212262
Hexadecimal	0x2114B2

Divisor Catalog (16)

1 2 3 6 67 134 201 402 5,393 10,786 16,179 32,358 361,331 722,662 1,083,993 2,167,986

Collatz Trajectory (148 steps to reach 1)

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

2,167,986 1,083,993 3,251,980 1,625,990 812,995 2,438,986 1,219,493 3,658,480 1,829,240 914,620 457,310 228,655 685,966 342,983 1,028,950 514,475 1,543,426 771,713 2,315,140 1,157,570 578,785 1,736,356 868,178 434,089 1,302,268 651,134 325,567 976,702 488,351 1,465,054 732,527 2,197,582 1,098,791 3,296,374 1,648,187 4,944,562 2,472,281 7,416,844 3,708,422 1,854,211 5,562,634 2,781,317 8,343,952 4,171,976 2,085,988 1,042,994 521,497 1,564,492 782,246 391,123 1,173,370 586,685 1,760,056 880,028 440,014 220,007 660,022 330,011 990,034 495,017

← Previous Integer #2,167,985 Browse Full Index Next Integer #2,167,987 →