GCD of 643, 303, 124 Calculator

Given Input numbers are 643, 303, 124

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

Divisors of 643

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

1, 643

Divisors of 303

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

1, 3, 101, 303

Divisors of 124

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

1, 2, 4, 31, 62, 124

Greatest Common Divisior

We found the divisors of 643, 303, 124 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 643, 303, 124 is 1.

Therefore, GCD of numbers 643, 303, 124 is 1

Given Input Data is 643, 303, 124

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

Prime Factorization of 643 is 643

Prime Factorization of 303 is 3 x 101

Prime Factorization of 124 is 2 x 2 x 31

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(643, 303) = 194829

GCD(643, 303) = ( 643 x 303 ) / 194829

GCD(643, 303) = 194829 / 194829

GCD(643, 303) = 1

Step2:

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

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

LCM(1, 124) = 124

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

GCD(1, 124) = 124 / 124

GCD(1, 124) = 1

GCD of 643, 303, 124 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 768, 542, 863
• GCD of 288, 560, 600
• GCD of 370, 278, 193
• GCD of 182, 289, 661
• GCD of 111, 601, 295

1. What is the GCD of 643, 303, 124?

GCD of 643, 303, 124 is 1

2. Where do I get the detailed procedure to find GCD of 643, 303, 124?

You can find a detailed procedure to find GCD of 643, 303, 124 on our page.

3. How to find GCD of 643, 303, 124 on a calculator?

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