GCD of 847, 856, 39 Calculator

Given Input numbers are 847, 856, 39

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

Divisors of 847

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

1, 7, 11, 77, 121, 847

Divisors of 856

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

1, 2, 4, 8, 107, 214, 428, 856

Divisors of 39

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

1, 3, 13, 39

Greatest Common Divisior

We found the divisors of 847, 856, 39 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 847, 856, 39 is 1.

Therefore, GCD of numbers 847, 856, 39 is 1

Given Input Data is 847, 856, 39

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

Prime Factorization of 847 is 7 x 11 x 11

Prime Factorization of 856 is 2 x 2 x 2 x 107

Prime Factorization of 39 is 3 x 13

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(847, 856) = 725032

GCD(847, 856) = ( 847 x 856 ) / 725032

GCD(847, 856) = 725032 / 725032

GCD(847, 856) = 1

Step2:

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

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

LCM(1, 39) = 39

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

GCD(1, 39) = 39 / 39

GCD(1, 39) = 1

GCD of 847, 856, 39 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 669, 858, 82
• GCD of 938, 651, 13
• GCD of 460, 301, 38
• GCD of 522, 842, 46
• GCD of 960, 612, 32

1. What is the GCD of 847, 856, 39?

GCD of 847, 856, 39 is 1

2. Where do I get the detailed procedure to find GCD of 847, 856, 39?

You can find a detailed procedure to find GCD of 847, 856, 39 on our page.

3. How to find GCD of 847, 856, 39 on a calculator?

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