GCD of 893, 679, 172 Calculator

Given Input numbers are 893, 679, 172

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

Divisors of 893

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

1, 19, 47, 893

Divisors of 679

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

1, 7, 97, 679

Divisors of 172

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

1, 2, 4, 43, 86, 172

Greatest Common Divisior

We found the divisors of 893, 679, 172 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 893, 679, 172 is 1.

Therefore, GCD of numbers 893, 679, 172 is 1

Given Input Data is 893, 679, 172

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

Prime Factorization of 893 is 19 x 47

Prime Factorization of 679 is 7 x 97

Prime Factorization of 172 is 2 x 2 x 43

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(893, 679) = 606347

GCD(893, 679) = ( 893 x 679 ) / 606347

GCD(893, 679) = 606347 / 606347

GCD(893, 679) = 1

Step2:

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

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

LCM(1, 172) = 172

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

GCD(1, 172) = 172 / 172

GCD(1, 172) = 1

GCD of 893, 679, 172 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 496, 993, 380
• GCD of 323, 980, 391
• GCD of 955, 325, 578
• GCD of 171, 782, 707
• GCD of 731, 371, 406

1. What is the GCD of 893, 679, 172?

GCD of 893, 679, 172 is 1

2. Where do I get the detailed procedure to find GCD of 893, 679, 172?

You can find a detailed procedure to find GCD of 893, 679, 172 on our page.

3. How to find GCD of 893, 679, 172 on a calculator?

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