2,100,846

2 × 3 × 11 × 139 × 229

2,100,846 factors as 2 × 3 × 11 × 139 × 229. Its 32 positive divisors give a proper-divisor sum of 2,535,954, so this integer is abundant. The Collatz stopping time is 91 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 139 × 229

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 4,636,800

Proper Divisor Sum 2,535,954

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #2100841 ← → #2100859

Radix Representation

Decimal	2100846
Binary	1000000000111001101110 (22 bits)
Octal	0o10007156
Hexadecimal	0x200E6E

Divisor Catalog (32)

1 2 3 6 11 22 33 66 139 229 278 417 458 687 834 1,374 1,529 2,519 3,058 4,587 5,038 7,557 9,174 15,114 31,831 63,662 95,493 190,986 350,141 700,282 1,050,423 2,100,846

Collatz Trajectory (91 steps to reach 1)

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

2,100,846 1,050,423 3,151,270 1,575,635 4,726,906 2,363,453 7,090,360 3,545,180 1,772,590 886,295 2,658,886 1,329,443 3,988,330 1,994,165 5,982,496 2,991,248 1,495,624 747,812 373,906 186,953 560,860 280,430 140,215 420,646 210,323 630,970 315,485 946,456 473,228 236,614 118,307 354,922 177,461 532,384 266,192 133,096 66,548 33,274 16,637 49,912 24,956 12,478 6,239 18,718 9,359 28,078 14,039 42,118 21,059 63,178 31,589 94,768 47,384 23,692 11,846 5,923 17,770 8,885 26,656 13,328

← Previous Integer #2,100,845 Browse Full Index Next Integer #2,100,847 →