GCD of 472, 313, 117 Calculator

Given Input numbers are 472, 313, 117

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

Divisors of 472

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

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

Divisors of 313

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

1, 313

Divisors of 117

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

1, 3, 9, 13, 39, 117

Greatest Common Divisior

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

Therefore, GCD of numbers 472, 313, 117 is 1

Given Input Data is 472, 313, 117

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

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

Prime Factorization of 313 is 313

Prime Factorization of 117 is 3 x 3 x 13

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(472, 313) = 147736

GCD(472, 313) = ( 472 x 313 ) / 147736

GCD(472, 313) = 147736 / 147736

GCD(472, 313) = 1

Step2:

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

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

LCM(1, 117) = 117

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

GCD(1, 117) = 117 / 117

GCD(1, 117) = 1

GCD of 472, 313, 117 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 330, 585, 923
• GCD of 552, 229, 897
• GCD of 640, 649, 716
• GCD of 207, 465, 990
• GCD of 395, 696, 905

1. What is the GCD of 472, 313, 117?

GCD of 472, 313, 117 is 1

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

You can find a detailed procedure to find GCD of 472, 313, 117 on our page.

3. How to find GCD of 472, 313, 117 on a calculator?

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