GCD of 502, 285, 30 Calculator

Given Input numbers are 502, 285, 30

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

Divisors of 502

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

1, 2, 251, 502

Divisors of 285

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

1, 3, 5, 15, 19, 57, 95, 285

Divisors of 30

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

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

Greatest Common Divisior

We found the divisors of 502, 285, 30 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 502, 285, 30 is 1.

Therefore, GCD of numbers 502, 285, 30 is 1

Given Input Data is 502, 285, 30

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

Prime Factorization of 502 is 2 x 251

Prime Factorization of 285 is 3 x 5 x 19

Prime Factorization of 30 is 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(502, 285) = 143070

GCD(502, 285) = ( 502 x 285 ) / 143070

GCD(502, 285) = 143070 / 143070

GCD(502, 285) = 1

Step2:

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

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

LCM(1, 30) = 30

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

GCD(1, 30) = 30 / 30

GCD(1, 30) = 1

GCD of 502, 285, 30 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 302, 497, 46
• GCD of 469, 215, 61
• GCD of 481, 255, 56
• GCD of 143, 512, 84
• GCD of 924, 527, 18

1. What is the GCD of 502, 285, 30?

GCD of 502, 285, 30 is 1

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

You can find a detailed procedure to find GCD of 502, 285, 30 on our page.

3. How to find GCD of 502, 285, 30 on a calculator?

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