Created By : Jatin Gogia
Reviewed By : Rajasekhar Valipishetty
Last Updated : Apr 06, 2023
Make use of GCD Calculator to determine the Greatest Common Divisor of 130, 594, 748, 643 i.e. 1 largest integer that divides all the numbers equally.
GCD of 130, 594, 748, 643 is 1
GCD(130, 594, 748, 643) = 1
Ex: 10, 15, 20 (or) 24, 48, 96,45 (or) 78902, 89765, 12345
GCD of numbers 130, 594, 748, 643 is 1
GCD(130, 594, 748, 643) = 1
Given Input numbers are 130, 594, 748, 643
To find the GCD of numbers using factoring list out all the divisors of each number
Divisors of 130
List of positive integer divisors of 130 that divides 130 without a remainder.
1, 2, 5, 10, 13, 26, 65, 130
Divisors of 594
List of positive integer divisors of 594 that divides 594 without a remainder.
1, 2, 3, 6, 9, 11, 18, 22, 27, 33, 54, 66, 99, 198, 297, 594
Divisors of 748
List of positive integer divisors of 748 that divides 748 without a remainder.
1, 2, 4, 11, 17, 22, 34, 44, 68, 187, 374, 748
Divisors of 643
List of positive integer divisors of 643 that divides 643 without a remainder.
1, 643
Greatest Common Divisior
We found the divisors of 130, 594, 748, 643 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 130, 594, 748, 643 is 1.
Therefore, GCD of numbers 130, 594, 748, 643 is 1
Given Input Data is 130, 594, 748, 643
Make a list of Prime Factors of all the given numbers initially
Prime Factorization of 130 is 2 x 5 x 13
Prime Factorization of 594 is 2 x 3 x 3 x 3 x 11
Prime Factorization of 748 is 2 x 2 x 11 x 17
Prime Factorization of 643 is 643
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(130, 594) = 38610
GCD(130, 594) = ( 130 x 594 ) / 38610
GCD(130, 594) = 77220 / 38610
GCD(130, 594) = 2
Step2:
Here we consider the GCD from the above i.e. 2 as first number and the next as 748
The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)
LCM(2, 748) = 748
GCD(2, 748) = ( 2 x 748 ) / 748
GCD(2, 748) = 1496 / 748
GCD(2, 748) = 2
Step3:
Here we consider the GCD from the above i.e. 2 as first number and the next as 643
The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)
LCM(2, 643) = 1286
GCD(2, 643) = ( 2 x 643 ) / 1286
GCD(2, 643) = 1286 / 1286
GCD(2, 643) = 1
GCD of 130, 594, 748, 643 is 1
Here are some samples of GCD of Numbers calculations.
1. What is the GCD of 130, 594, 748, 643?
GCD of 130, 594, 748, 643 is 1
2. Where do I get the detailed procedure to find GCD of 130, 594, 748, 643?
You can find a detailed procedure to find GCD of 130, 594, 748, 643 on our page.
3. How to find GCD of 130, 594, 748, 643 on a calculator?
You can find the GCD of 130, 594, 748, 643 by simply giving the inputs separated by commas and click on the calculate button to avail the Greatest Common Divisor in less time.