GCD of 103, 138, 862 Calculator

Given Input numbers are 103, 138, 862

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

Divisors of 103

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

1, 103

Divisors of 138

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

1, 2, 3, 6, 23, 46, 69, 138

Divisors of 862

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

1, 2, 431, 862

Greatest Common Divisior

We found the divisors of 103, 138, 862 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 103, 138, 862 is 1.

Therefore, GCD of numbers 103, 138, 862 is 1

Given Input Data is 103, 138, 862

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

Prime Factorization of 103 is 103

Prime Factorization of 138 is 2 x 3 x 23

Prime Factorization of 862 is 2 x 431

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(103, 138) = 14214

GCD(103, 138) = ( 103 x 138 ) / 14214

GCD(103, 138) = 14214 / 14214

GCD(103, 138) = 1

Step2:

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

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

LCM(1, 862) = 862

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

GCD(1, 862) = 862 / 862

GCD(1, 862) = 1

GCD of 103, 138, 862 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 143, 709, 489
• GCD of 511, 903, 242
• GCD of 829, 430, 904
• GCD of 380, 632, 635
• GCD of 465, 980, 922

1. What is the GCD of 103, 138, 862?

GCD of 103, 138, 862 is 1

2. Where do I get the detailed procedure to find GCD of 103, 138, 862?

You can find a detailed procedure to find GCD of 103, 138, 862 on our page.

3. How to find GCD of 103, 138, 862 on a calculator?

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