GCD of 148, 309, 673 Calculator

Given Input numbers are 148, 309, 673

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

Divisors of 148

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

1, 2, 4, 37, 74, 148

Divisors of 309

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

1, 3, 103, 309

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 148, 309, 673 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 148, 309, 673 is 1.

Therefore, GCD of numbers 148, 309, 673 is 1

Given Input Data is 148, 309, 673

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

Prime Factorization of 148 is 2 x 2 x 37

Prime Factorization of 309 is 3 x 103

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(148, 309) = 45732

GCD(148, 309) = ( 148 x 309 ) / 45732

GCD(148, 309) = 45732 / 45732

GCD(148, 309) = 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 148, 309, 673 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 308, 774, 968
• GCD of 718, 626, 758
• GCD of 363, 914, 949
• GCD of 145, 592, 479
• GCD of 588, 501, 612

1. What is the GCD of 148, 309, 673?

GCD of 148, 309, 673 is 1

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

You can find a detailed procedure to find GCD of 148, 309, 673 on our page.

3. How to find GCD of 148, 309, 673 on a calculator?

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