GCD of 538, 507, 642 Calculator

Given Input numbers are 538, 507, 642

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

Divisors of 538

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

1, 2, 269, 538

Divisors of 507

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

1, 3, 13, 39, 169, 507

Divisors of 642

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

1, 2, 3, 6, 107, 214, 321, 642

Greatest Common Divisior

We found the divisors of 538, 507, 642 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 538, 507, 642 is 1.

Therefore, GCD of numbers 538, 507, 642 is 1

Given Input Data is 538, 507, 642

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

Prime Factorization of 538 is 2 x 269

Prime Factorization of 507 is 3 x 13 x 13

Prime Factorization of 642 is 2 x 3 x 107

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(538, 507) = 272766

GCD(538, 507) = ( 538 x 507 ) / 272766

GCD(538, 507) = 272766 / 272766

GCD(538, 507) = 1

Step2:

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

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

LCM(1, 642) = 642

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

GCD(1, 642) = 642 / 642

GCD(1, 642) = 1

GCD of 538, 507, 642 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 173, 691, 759
• GCD of 387, 398, 254
• GCD of 175, 637, 257
• GCD of 215, 748, 448
• GCD of 504, 393, 467

1. What is the GCD of 538, 507, 642?

GCD of 538, 507, 642 is 1

2. Where do I get the detailed procedure to find GCD of 538, 507, 642?

You can find a detailed procedure to find GCD of 538, 507, 642 on our page.

3. How to find GCD of 538, 507, 642 on a calculator?

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