GCD of 143, 387, 673 Calculator

Given Input numbers are 143, 387, 673

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

Divisors of 143

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

1, 11, 13, 143

Divisors of 387

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

1, 3, 9, 43, 129, 387

Divisors of 673

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

1, 673

Greatest Common Divisior

We found the divisors of 143, 387, 673 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 143, 387, 673 is 1.

Therefore, GCD of numbers 143, 387, 673 is 1

Given Input Data is 143, 387, 673

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

Prime Factorization of 143 is 11 x 13

Prime Factorization of 387 is 3 x 3 x 43

Prime Factorization of 673 is 673

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(143, 387) = 55341

GCD(143, 387) = ( 143 x 387 ) / 55341

GCD(143, 387) = 55341 / 55341

GCD(143, 387) = 1

Step2:

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

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

LCM(1, 673) = 673

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

GCD(1, 673) = 673 / 673

GCD(1, 673) = 1

GCD of 143, 387, 673 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 653, 797, 771
• GCD of 665, 454, 573
• GCD of 965, 697, 497
• GCD of 135, 566, 212
• GCD of 394, 597, 569

1. What is the GCD of 143, 387, 673?

GCD of 143, 387, 673 is 1

2. Where do I get the detailed procedure to find GCD of 143, 387, 673?

You can find a detailed procedure to find GCD of 143, 387, 673 on our page.

3. How to find GCD of 143, 387, 673 on a calculator?

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