GCD of 313, 481, 802 Calculator

Given Input numbers are 313, 481, 802

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

Divisors of 313

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

1, 313

Divisors of 481

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

1, 13, 37, 481

Divisors of 802

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

1, 2, 401, 802

Greatest Common Divisior

We found the divisors of 313, 481, 802 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 313, 481, 802 is 1.

Therefore, GCD of numbers 313, 481, 802 is 1

Given Input Data is 313, 481, 802

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

Prime Factorization of 313 is 313

Prime Factorization of 481 is 13 x 37

Prime Factorization of 802 is 2 x 401

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(313, 481) = 150553

GCD(313, 481) = ( 313 x 481 ) / 150553

GCD(313, 481) = 150553 / 150553

GCD(313, 481) = 1

Step2:

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

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

LCM(1, 802) = 802

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

GCD(1, 802) = 802 / 802

GCD(1, 802) = 1

GCD of 313, 481, 802 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 139, 636, 659
• GCD of 116, 832, 343
• GCD of 252, 736, 452
• GCD of 664, 214, 870
• GCD of 636, 127, 137

1. What is the GCD of 313, 481, 802?

GCD of 313, 481, 802 is 1

2. Where do I get the detailed procedure to find GCD of 313, 481, 802?

You can find a detailed procedure to find GCD of 313, 481, 802 on our page.

3. How to find GCD of 313, 481, 802 on a calculator?

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