GCD of 993, 691, 446 Calculator

Given Input numbers are 993, 691, 446

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

Divisors of 993

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

1, 3, 331, 993

Divisors of 691

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

1, 691

Divisors of 446

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

1, 2, 223, 446

Greatest Common Divisior

We found the divisors of 993, 691, 446 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 993, 691, 446 is 1.

Therefore, GCD of numbers 993, 691, 446 is 1

Given Input Data is 993, 691, 446

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

Prime Factorization of 993 is 3 x 331

Prime Factorization of 691 is 691

Prime Factorization of 446 is 2 x 223

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(993, 691) = 686163

GCD(993, 691) = ( 993 x 691 ) / 686163

GCD(993, 691) = 686163 / 686163

GCD(993, 691) = 1

Step2:

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

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

LCM(1, 446) = 446

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

GCD(1, 446) = 446 / 446

GCD(1, 446) = 1

GCD of 993, 691, 446 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 512, 556, 451
• GCD of 485, 164, 858
• GCD of 492, 387, 855
• GCD of 213, 162, 766
• GCD of 877, 782, 207

1. What is the GCD of 993, 691, 446?

GCD of 993, 691, 446 is 1

2. Where do I get the detailed procedure to find GCD of 993, 691, 446?

You can find a detailed procedure to find GCD of 993, 691, 446 on our page.

3. How to find GCD of 993, 691, 446 on a calculator?

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