2,160,618

2 × 3 × 41 × 8783

2,160,618 factors as 2 × 3 × 41 × 8783. Its 16 positive divisors give a proper-divisor sum of 2,266,518, so this integer is abundant. The Collatz stopping time is 91 steps.

Prime Factor Structure

Factorization String 2 × 3 × 41 × 8783

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,427,136

Proper Divisor Sum 2,266,518

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2160617 ← → #2160619

Radix Representation

Decimal	2160618
Binary	1000001111011111101010 (22 bits)
Octal	0o10173752
Hexadecimal	0x20F7EA

Divisor Catalog (16)

1 2 3 6 41 82 123 246 8,783 17,566 26,349 52,698 360,103 720,206 1,080,309 2,160,618

Collatz Trajectory (91 steps to reach 1)

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

2,160,618 1,080,309 3,240,928 1,620,464 810,232 405,116 202,558 101,279 303,838 151,919 455,758 227,879 683,638 341,819 1,025,458 512,729 1,538,188 769,094 384,547 1,153,642 576,821 1,730,464 865,232 432,616 216,308 108,154 54,077 162,232 81,116 40,558 20,279 60,838 30,419 91,258 45,629 136,888 68,444 34,222 17,111 51,334 25,667 77,002 38,501 115,504 57,752 28,876 14,438 7,219 21,658 10,829 32,488 16,244 8,122 4,061 12,184 6,092 3,046 1,523 4,570 2,285

← Previous Integer #2,160,617 Browse Full Index Next Integer #2,160,619 →