GCD of 542, 535, 145 Calculator

Given Input numbers are 542, 535, 145

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

Divisors of 542

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

1, 2, 271, 542

Divisors of 535

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

1, 5, 107, 535

Divisors of 145

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

1, 5, 29, 145

Greatest Common Divisior

We found the divisors of 542, 535, 145 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 542, 535, 145 is 1.

Therefore, GCD of numbers 542, 535, 145 is 1

Given Input Data is 542, 535, 145

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

Prime Factorization of 542 is 2 x 271

Prime Factorization of 535 is 5 x 107

Prime Factorization of 145 is 5 x 29

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(542, 535) = 289970

GCD(542, 535) = ( 542 x 535 ) / 289970

GCD(542, 535) = 289970 / 289970

GCD(542, 535) = 1

Step2:

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

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

LCM(1, 145) = 145

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

GCD(1, 145) = 145 / 145

GCD(1, 145) = 1

GCD of 542, 535, 145 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 357, 173, 427
• GCD of 963, 262, 329
• GCD of 633, 758, 782
• GCD of 516, 272, 941
• GCD of 329, 716, 425

1. What is the GCD of 542, 535, 145?

GCD of 542, 535, 145 is 1

2. Where do I get the detailed procedure to find GCD of 542, 535, 145?

You can find a detailed procedure to find GCD of 542, 535, 145 on our page.

3. How to find GCD of 542, 535, 145 on a calculator?

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