GCD of 109, 386, 129 Calculator

Given Input numbers are 109, 386, 129

To find the GCD of numbers using factoring list out all the divisors of each number

Divisors of 109

List of positive integer divisors of 109 that divides 109 without a remainder.

1, 109

Divisors of 386

List of positive integer divisors of 386 that divides 386 without a remainder.

1, 2, 193, 386

Divisors of 129

List of positive integer divisors of 129 that divides 129 without a remainder.

1, 3, 43, 129

Greatest Common Divisior

We found the divisors of 109, 386, 129 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 109, 386, 129 is 1.

Therefore, GCD of numbers 109, 386, 129 is 1

Given Input Data is 109, 386, 129

Make a list of Prime Factors of all the given numbers initially

Prime Factorization of 109 is 109

Prime Factorization of 386 is 2 x 193

Prime Factorization of 129 is 3 x 43

The above numbers do not have any common prime factor. So GCD is 1

Step1:

Let's calculate the GCD of first two numbers

The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)

LCM(109, 386) = 42074

GCD(109, 386) = ( 109 x 386 ) / 42074

GCD(109, 386) = 42074 / 42074

GCD(109, 386) = 1

Step2:

Here we consider the GCD from the above i.e. 1 as first number and the next as 129

The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)

LCM(1, 129) = 129

GCD(1, 129) = ( 1 x 129 ) / 129

GCD(1, 129) = 129 / 129

GCD(1, 129) = 1

GCD of 109, 386, 129 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 733, 275, 404
• GCD of 926, 258, 104
• GCD of 671, 302, 240
• GCD of 822, 253, 225
• GCD of 426, 128, 352

1. What is the GCD of 109, 386, 129?

GCD of 109, 386, 129 is 1

2. Where do I get the detailed procedure to find GCD of 109, 386, 129?

You can find a detailed procedure to find GCD of 109, 386, 129 on our page.

3. How to find GCD of 109, 386, 129 on a calculator?

You can find the GCD of 109, 386, 129 by simply giving the inputs separated by commas and click on the calculate button to avail the Greatest Common Divisor in less time.