GCD of 364, 663, 926 Calculator

Given Input numbers are 364, 663, 926

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

Divisors of 364

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

1, 2, 4, 7, 13, 14, 26, 28, 52, 91, 182, 364

Divisors of 663

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

1, 3, 13, 17, 39, 51, 221, 663

Divisors of 926

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

1, 2, 463, 926

Greatest Common Divisior

We found the divisors of 364, 663, 926 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 364, 663, 926 is 1.

Therefore, GCD of numbers 364, 663, 926 is 1

Given Input Data is 364, 663, 926

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

Prime Factorization of 364 is 2 x 2 x 7 x 13

Prime Factorization of 663 is 3 x 13 x 17

Prime Factorization of 926 is 2 x 463

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(364, 663) = 18564

GCD(364, 663) = ( 364 x 663 ) / 18564

GCD(364, 663) = 241332 / 18564

GCD(364, 663) = 13

Step2:

Here we consider the GCD from the above i.e. 13 as first number and the next as 926

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

LCM(13, 926) = 12038

GCD(13, 926) = ( 13 x 926 ) / 12038

GCD(13, 926) = 12038 / 12038

GCD(13, 926) = 1

GCD of 364, 663, 926 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 258, 724, 981
• GCD of 136, 669, 208
• GCD of 342, 706, 184
• GCD of 331, 677, 501
• GCD of 173, 724, 717

1. What is the GCD of 364, 663, 926?

GCD of 364, 663, 926 is 1

2. Where do I get the detailed procedure to find GCD of 364, 663, 926?

You can find a detailed procedure to find GCD of 364, 663, 926 on our page.

3. How to find GCD of 364, 663, 926 on a calculator?

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