2,119,962

2 × 3 × 13 × 27179

2,119,962 factors as 2 × 3 × 13 × 27179. Its 16 positive divisors give a proper-divisor sum of 2,446,278, so this integer is abundant. The Collatz stopping time is 166 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 27179

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,566,240

Proper Divisor Sum 2,446,278

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2119939 ← → #2119967

Radix Representation

Decimal	2119962
Binary	1000000101100100011010 (22 bits)
Octal	0o10054432
Hexadecimal	0x20591A

Divisor Catalog (16)

1 2 3 6 13 26 39 78 27,179 54,358 81,537 163,074 353,327 706,654 1,059,981 2,119,962

Collatz Trajectory (166 steps to reach 1)

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

2,119,962 1,059,981 3,179,944 1,589,972 794,986 397,493 1,192,480 596,240 298,120 149,060 74,530 37,265 111,796 55,898 27,949 83,848 41,924 20,962 10,481 31,444 15,722 7,861 23,584 11,792 5,896 2,948 1,474 737 2,212 1,106 553 1,660 830 415 1,246 623 1,870 935 2,806 1,403 4,210 2,105 6,316 3,158 1,579 4,738 2,369 7,108 3,554 1,777 5,332 2,666 1,333 4,000 2,000 1,000 500 250 125 376

← Previous Integer #2,119,961 Browse Full Index Next Integer #2,119,963 →