GCD of 797, 641, 472 Calculator

Given Input numbers are 797, 641, 472

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

Divisors of 797

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

1, 797

Divisors of 641

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

1, 641

Divisors of 472

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

1, 2, 4, 8, 59, 118, 236, 472

Greatest Common Divisior

We found the divisors of 797, 641, 472 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 797, 641, 472 is 1.

Therefore, GCD of numbers 797, 641, 472 is 1

Given Input Data is 797, 641, 472

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

Prime Factorization of 797 is 797

Prime Factorization of 641 is 641

Prime Factorization of 472 is 2 x 2 x 2 x 59

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(797, 641) = 510877

GCD(797, 641) = ( 797 x 641 ) / 510877

GCD(797, 641) = 510877 / 510877

GCD(797, 641) = 1

Step2:

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

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

LCM(1, 472) = 472

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

GCD(1, 472) = 472 / 472

GCD(1, 472) = 1

GCD of 797, 641, 472 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 133, 407, 101
• GCD of 420, 893, 783
• GCD of 916, 547, 796
• GCD of 875, 359, 694
• GCD of 171, 940, 432

1. What is the GCD of 797, 641, 472?

GCD of 797, 641, 472 is 1

2. Where do I get the detailed procedure to find GCD of 797, 641, 472?

You can find a detailed procedure to find GCD of 797, 641, 472 on our page.

3. How to find GCD of 797, 641, 472 on a calculator?

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