GCD of 143, 146, 815 Calculator

Given Input numbers are 143, 146, 815

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

Divisors of 143

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

1, 11, 13, 143

Divisors of 146

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

1, 2, 73, 146

Divisors of 815

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

1, 5, 163, 815

Greatest Common Divisior

We found the divisors of 143, 146, 815 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 143, 146, 815 is 1.

Therefore, GCD of numbers 143, 146, 815 is 1

Given Input Data is 143, 146, 815

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

Prime Factorization of 143 is 11 x 13

Prime Factorization of 146 is 2 x 73

Prime Factorization of 815 is 5 x 163

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(143, 146) = 20878

GCD(143, 146) = ( 143 x 146 ) / 20878

GCD(143, 146) = 20878 / 20878

GCD(143, 146) = 1

Step2:

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

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

LCM(1, 815) = 815

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

GCD(1, 815) = 815 / 815

GCD(1, 815) = 1

GCD of 143, 146, 815 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 698, 762, 457
• GCD of 875, 965, 232
• GCD of 420, 614, 200
• GCD of 461, 658, 609
• GCD of 575, 485, 629

1. What is the GCD of 143, 146, 815?

GCD of 143, 146, 815 is 1

2. Where do I get the detailed procedure to find GCD of 143, 146, 815?

You can find a detailed procedure to find GCD of 143, 146, 815 on our page.

3. How to find GCD of 143, 146, 815 on a calculator?

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