GCD of 778, 391, 467 Calculator

Given Input numbers are 778, 391, 467

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

Divisors of 778

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

1, 2, 389, 778

Divisors of 391

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

1, 17, 23, 391

Divisors of 467

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

1, 467

Greatest Common Divisior

We found the divisors of 778, 391, 467 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 778, 391, 467 is 1.

Therefore, GCD of numbers 778, 391, 467 is 1

Given Input Data is 778, 391, 467

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

Prime Factorization of 778 is 2 x 389

Prime Factorization of 391 is 17 x 23

Prime Factorization of 467 is 467

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(778, 391) = 304198

GCD(778, 391) = ( 778 x 391 ) / 304198

GCD(778, 391) = 304198 / 304198

GCD(778, 391) = 1

Step2:

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

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

LCM(1, 467) = 467

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

GCD(1, 467) = 467 / 467

GCD(1, 467) = 1

GCD of 778, 391, 467 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 969, 457, 618
• GCD of 461, 249, 102
• GCD of 922, 726, 830
• GCD of 683, 829, 486
• GCD of 593, 872, 227

1. What is the GCD of 778, 391, 467?

GCD of 778, 391, 467 is 1

2. Where do I get the detailed procedure to find GCD of 778, 391, 467?

You can find a detailed procedure to find GCD of 778, 391, 467 on our page.

3. How to find GCD of 778, 391, 467 on a calculator?

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