GCD of 793, 309, 60 Calculator

Given Input numbers are 793, 309, 60

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

Divisors of 793

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

1, 13, 61, 793

Divisors of 309

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

1, 3, 103, 309

Divisors of 60

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

1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60

Greatest Common Divisior

We found the divisors of 793, 309, 60 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 793, 309, 60 is 1.

Therefore, GCD of numbers 793, 309, 60 is 1

Given Input Data is 793, 309, 60

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

Prime Factorization of 793 is 13 x 61

Prime Factorization of 309 is 3 x 103

Prime Factorization of 60 is 2 x 2 x 3 x 5

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(793, 309) = 245037

GCD(793, 309) = ( 793 x 309 ) / 245037

GCD(793, 309) = 245037 / 245037

GCD(793, 309) = 1

Step2:

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

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

LCM(1, 60) = 60

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

GCD(1, 60) = 60 / 60

GCD(1, 60) = 1

GCD of 793, 309, 60 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 621, 913, 27
• GCD of 626, 628, 14
• GCD of 917, 779, 22
• GCD of 899, 183, 55
• GCD of 143, 359, 92

1. What is the GCD of 793, 309, 60?

GCD of 793, 309, 60 is 1

2. Where do I get the detailed procedure to find GCD of 793, 309, 60?

You can find a detailed procedure to find GCD of 793, 309, 60 on our page.

3. How to find GCD of 793, 309, 60 on a calculator?

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