GCD of 848, 393, 11 Calculator

Given Input numbers are 848, 393, 11

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

Divisors of 848

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

1, 2, 4, 8, 16, 53, 106, 212, 424, 848

Divisors of 393

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

1, 3, 131, 393

Divisors of 11

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

1, 11

Greatest Common Divisior

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

Therefore, GCD of numbers 848, 393, 11 is 1

Given Input Data is 848, 393, 11

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

Prime Factorization of 848 is 2 x 2 x 2 x 2 x 53

Prime Factorization of 393 is 3 x 131

Prime Factorization of 11 is 11

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(848, 393) = 333264

GCD(848, 393) = ( 848 x 393 ) / 333264

GCD(848, 393) = 333264 / 333264

GCD(848, 393) = 1

Step2:

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

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

LCM(1, 11) = 11

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

GCD(1, 11) = 11 / 11

GCD(1, 11) = 1

GCD of 848, 393, 11 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 308, 834, 29
• GCD of 763, 742, 33
• GCD of 979, 946, 94
• GCD of 375, 511, 32
• GCD of 738, 559, 17

1. What is the GCD of 848, 393, 11?

GCD of 848, 393, 11 is 1

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

You can find a detailed procedure to find GCD of 848, 393, 11 on our page.

3. How to find GCD of 848, 393, 11 on a calculator?

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