GCD of 853, 939, 72 Calculator

Given Input numbers are 853, 939, 72

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

Divisors of 853

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

1, 853

Divisors of 939

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

1, 3, 313, 939

Divisors of 72

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

1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72

Greatest Common Divisior

We found the divisors of 853, 939, 72 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 853, 939, 72 is 1.

Therefore, GCD of numbers 853, 939, 72 is 1

Given Input Data is 853, 939, 72

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

Prime Factorization of 853 is 853

Prime Factorization of 939 is 3 x 313

Prime Factorization of 72 is 2 x 2 x 2 x 3 x 3

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(853, 939) = 800967

GCD(853, 939) = ( 853 x 939 ) / 800967

GCD(853, 939) = 800967 / 800967

GCD(853, 939) = 1

Step2:

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

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

LCM(1, 72) = 72

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

GCD(1, 72) = 72 / 72

GCD(1, 72) = 1

GCD of 853, 939, 72 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 636, 645, 53
• GCD of 314, 168, 54
• GCD of 539, 482, 14
• GCD of 124, 591, 28
• GCD of 800, 347, 45

1. What is the GCD of 853, 939, 72?

GCD of 853, 939, 72 is 1

2. Where do I get the detailed procedure to find GCD of 853, 939, 72?

You can find a detailed procedure to find GCD of 853, 939, 72 on our page.

3. How to find GCD of 853, 939, 72 on a calculator?

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