2,137,686

2 × 3 × 97 × 3673

2,137,686 factors as 2 × 3 × 97 × 3673. Its 16 positive divisors give a proper-divisor sum of 2,182,938, so this integer is abundant. The Collatz stopping time is 73 steps.

Prime Factor Structure

Factorization String 2 × 3 × 97 × 3673

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,320,624

Proper Divisor Sum 2,182,938

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2137679 ← → #2137687

Radix Representation

Decimal	2137686
Binary	1000001001111001010110 (22 bits)
Octal	0o10117126
Hexadecimal	0x209E56

Divisor Catalog (16)

1 2 3 6 97 194 291 582 3,673 7,346 11,019 22,038 356,281 712,562 1,068,843 2,137,686

Collatz Trajectory (73 steps to reach 1)

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

2,137,686 1,068,843 3,206,530 1,603,265 4,809,796 2,404,898 1,202,449 3,607,348 1,803,674 901,837 2,705,512 1,352,756 676,378 338,189 1,014,568 507,284 253,642 126,821 380,464 190,232 95,116 47,558 23,779 71,338 35,669 107,008 53,504 26,752 13,376 6,688 3,344 1,672 836 418 209 628 314 157 472 236 118 59 178 89 268 134 67 202 101 304 152 76 38 19 58 29 88 44 22 11

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,137,685 Browse Full Index Next Integer #2,137,687 →