GCD of 338, 211, 367 Calculator

Given Input numbers are 338, 211, 367

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

Divisors of 338

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

1, 2, 13, 26, 169, 338

Divisors of 211

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

1, 211

Divisors of 367

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

1, 367

Greatest Common Divisior

We found the divisors of 338, 211, 367 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 338, 211, 367 is 1.

Therefore, GCD of numbers 338, 211, 367 is 1

Given Input Data is 338, 211, 367

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

Prime Factorization of 338 is 2 x 13 x 13

Prime Factorization of 211 is 211

Prime Factorization of 367 is 367

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(338, 211) = 71318

GCD(338, 211) = ( 338 x 211 ) / 71318

GCD(338, 211) = 71318 / 71318

GCD(338, 211) = 1

Step2:

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

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

LCM(1, 367) = 367

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

GCD(1, 367) = 367 / 367

GCD(1, 367) = 1

GCD of 338, 211, 367 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 756, 248, 502
• GCD of 589, 553, 539
• GCD of 868, 226, 914
• GCD of 740, 301, 408
• GCD of 530, 697, 748

1. What is the GCD of 338, 211, 367?

GCD of 338, 211, 367 is 1

2. Where do I get the detailed procedure to find GCD of 338, 211, 367?

You can find a detailed procedure to find GCD of 338, 211, 367 on our page.

3. How to find GCD of 338, 211, 367 on a calculator?

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