GCD of 914, 158, 393 Calculator

Given Input numbers are 914, 158, 393

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

Divisors of 914

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

1, 2, 457, 914

Divisors of 158

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

1, 2, 79, 158

Divisors of 393

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

1, 3, 131, 393

Greatest Common Divisior

We found the divisors of 914, 158, 393 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 914, 158, 393 is 1.

Therefore, GCD of numbers 914, 158, 393 is 1

Given Input Data is 914, 158, 393

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

Prime Factorization of 914 is 2 x 457

Prime Factorization of 158 is 2 x 79

Prime Factorization of 393 is 3 x 131

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(914, 158) = 72206

GCD(914, 158) = ( 914 x 158 ) / 72206

GCD(914, 158) = 144412 / 72206

GCD(914, 158) = 2

Step2:

Here we consider the GCD from the above i.e. 2 as first number and the next as 393

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

LCM(2, 393) = 786

GCD(2, 393) = ( 2 x 393 ) / 786

GCD(2, 393) = 786 / 786

GCD(2, 393) = 1

GCD of 914, 158, 393 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 106, 725, 119
• GCD of 545, 784, 869
• GCD of 973, 705, 599
• GCD of 307, 459, 513
• GCD of 146, 954, 634

1. What is the GCD of 914, 158, 393?

GCD of 914, 158, 393 is 1

2. Where do I get the detailed procedure to find GCD of 914, 158, 393?

You can find a detailed procedure to find GCD of 914, 158, 393 on our page.

3. How to find GCD of 914, 158, 393 on a calculator?

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