GCD of 142, 529, 48 Calculator

Given Input numbers are 142, 529, 48

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

Divisors of 142

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

1, 2, 71, 142

Divisors of 529

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

1, 23, 529

Divisors of 48

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

1, 2, 3, 4, 6, 8, 12, 16, 24, 48

Greatest Common Divisior

We found the divisors of 142, 529, 48 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 142, 529, 48 is 1.

Therefore, GCD of numbers 142, 529, 48 is 1

Given Input Data is 142, 529, 48

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

Prime Factorization of 142 is 2 x 71

Prime Factorization of 529 is 23 x 23

Prime Factorization of 48 is 2 x 2 x 2 x 2 x 3

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(142, 529) = 75118

GCD(142, 529) = ( 142 x 529 ) / 75118

GCD(142, 529) = 75118 / 75118

GCD(142, 529) = 1

Step2:

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

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

LCM(1, 48) = 48

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

GCD(1, 48) = 48 / 48

GCD(1, 48) = 1

GCD of 142, 529, 48 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 423, 359, 44
• GCD of 925, 102, 97
• GCD of 548, 402, 43
• GCD of 414, 781, 16
• GCD of 255, 612, 41

1. What is the GCD of 142, 529, 48?

GCD of 142, 529, 48 is 1

2. Where do I get the detailed procedure to find GCD of 142, 529, 48?

You can find a detailed procedure to find GCD of 142, 529, 48 on our page.

3. How to find GCD of 142, 529, 48 on a calculator?

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