GCD of 30, 52, 86 Calculator

Given Input numbers are 30, 52, 86

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

Divisors of 30

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

1, 2, 3, 5, 6, 10, 15, 30

Divisors of 52

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

1, 2, 4, 13, 26, 52

Divisors of 86

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

1, 2, 43, 86

Greatest Common Divisior

We found the divisors of 30, 52, 86 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 30, 52, 86 is 2.

Therefore, GCD of numbers 30, 52, 86 is 2

Given Input Data is 30, 52, 86

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

Prime Factorization of 30 is 2 x 3 x 5

Prime Factorization of 52 is 2 x 2 x 13

Prime Factorization of 86 is 2 x 43

Highest common occurrences in the given inputs are 2¹

Multiplying them we get the GCD as 2

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(30, 52) = 780

GCD(30, 52) = ( 30 x 52 ) / 780

GCD(30, 52) = 1560 / 780

GCD(30, 52) = 2

Step2:

Here we consider the GCD from the above i.e. 2 as first number and the next as 86

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

LCM(2, 86) = 86

GCD(2, 86) = ( 2 x 86 ) / 86

GCD(2, 86) = 172 / 86

GCD(2, 86) = 2

GCD of 30, 52, 86 is 2

Here are some samples of GCD of Numbers calculations.

• GCD of 34, 29, 61
• GCD of 72, 17, 71
• GCD of 25, 63, 97
• GCD of 23, 32, 82
• GCD of 83, 11, 72

1. What is the GCD of 30, 52, 86?

GCD of 30, 52, 86 is 2

2. Where do I get the detailed procedure to find GCD of 30, 52, 86?

You can find a detailed procedure to find GCD of 30, 52, 86 on our page.

3. How to find GCD of 30, 52, 86 on a calculator?

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