GCD of 722, 173, 397 Calculator

Given Input numbers are 722, 173, 397

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

Divisors of 722

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

1, 2, 19, 38, 361, 722

Divisors of 173

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

1, 173

Divisors of 397

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

1, 397

Greatest Common Divisior

We found the divisors of 722, 173, 397 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 722, 173, 397 is 1.

Therefore, GCD of numbers 722, 173, 397 is 1

Given Input Data is 722, 173, 397

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

Prime Factorization of 722 is 2 x 19 x 19

Prime Factorization of 173 is 173

Prime Factorization of 397 is 397

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(722, 173) = 124906

GCD(722, 173) = ( 722 x 173 ) / 124906

GCD(722, 173) = 124906 / 124906

GCD(722, 173) = 1

Step2:

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

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

LCM(1, 397) = 397

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

GCD(1, 397) = 397 / 397

GCD(1, 397) = 1

GCD of 722, 173, 397 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 334, 252, 606
• GCD of 682, 198, 462
• GCD of 539, 866, 173
• GCD of 253, 883, 961
• GCD of 925, 572, 894

1. What is the GCD of 722, 173, 397?

GCD of 722, 173, 397 is 1

2. Where do I get the detailed procedure to find GCD of 722, 173, 397?

You can find a detailed procedure to find GCD of 722, 173, 397 on our page.

3. How to find GCD of 722, 173, 397 on a calculator?

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