GCD of 991, 143, 333 Calculator

Given Input numbers are 991, 143, 333

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

Divisors of 991

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

1, 991

Divisors of 143

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

1, 11, 13, 143

Divisors of 333

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

1, 3, 9, 37, 111, 333

Greatest Common Divisior

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

Therefore, GCD of numbers 991, 143, 333 is 1

Given Input Data is 991, 143, 333

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

Prime Factorization of 991 is 991

Prime Factorization of 143 is 11 x 13

Prime Factorization of 333 is 3 x 3 x 37

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(991, 143) = 141713

GCD(991, 143) = ( 991 x 143 ) / 141713

GCD(991, 143) = 141713 / 141713

GCD(991, 143) = 1

Step2:

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

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

LCM(1, 333) = 333

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

GCD(1, 333) = 333 / 333

GCD(1, 333) = 1

GCD of 991, 143, 333 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 472, 817, 339
• GCD of 335, 840, 538
• GCD of 845, 105, 261
• GCD of 536, 763, 323
• GCD of 225, 424, 221

1. What is the GCD of 991, 143, 333?

GCD of 991, 143, 333 is 1

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

You can find a detailed procedure to find GCD of 991, 143, 333 on our page.

3. How to find GCD of 991, 143, 333 on a calculator?

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