GCD of 401, 862, 118 Calculator

Given Input numbers are 401, 862, 118

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

Divisors of 401

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

1, 401

Divisors of 862

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

1, 2, 431, 862

Divisors of 118

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

1, 2, 59, 118

Greatest Common Divisior

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

Therefore, GCD of numbers 401, 862, 118 is 1

Given Input Data is 401, 862, 118

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

Prime Factorization of 401 is 401

Prime Factorization of 862 is 2 x 431

Prime Factorization of 118 is 2 x 59

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(401, 862) = 345662

GCD(401, 862) = ( 401 x 862 ) / 345662

GCD(401, 862) = 345662 / 345662

GCD(401, 862) = 1

Step2:

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

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

LCM(1, 118) = 118

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

GCD(1, 118) = 118 / 118

GCD(1, 118) = 1

GCD of 401, 862, 118 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 898, 338, 169
• GCD of 434, 432, 971
• GCD of 454, 336, 247
• GCD of 176, 222, 471
• GCD of 230, 376, 883

1. What is the GCD of 401, 862, 118?

GCD of 401, 862, 118 is 1

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

You can find a detailed procedure to find GCD of 401, 862, 118 on our page.

3. How to find GCD of 401, 862, 118 on a calculator?

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