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 128, 912, 272, 668 i.e. 4 largest integer that divides all the numbers equally.
GCD of 128, 912, 272, 668 is 4
GCD(128, 912, 272, 668) = 4
Ex: 10, 15, 20 (or) 24, 48, 96,45 (or) 78902, 89765, 12345
GCD of numbers 128, 912, 272, 668 is 4
GCD(128, 912, 272, 668) = 4
Given Input numbers are 128, 912, 272, 668
To find the GCD of numbers using factoring list out all the divisors of each number
Divisors of 128
List of positive integer divisors of 128 that divides 128 without a remainder.
1, 2, 4, 8, 16, 32, 64, 128
Divisors of 912
List of positive integer divisors of 912 that divides 912 without a remainder.
1, 2, 3, 4, 6, 8, 12, 16, 19, 24, 38, 48, 57, 76, 114, 152, 228, 304, 456, 912
Divisors of 272
List of positive integer divisors of 272 that divides 272 without a remainder.
1, 2, 4, 8, 16, 17, 34, 68, 136, 272
Divisors of 668
List of positive integer divisors of 668 that divides 668 without a remainder.
1, 2, 4, 167, 334, 668
Greatest Common Divisior
We found the divisors of 128, 912, 272, 668 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 128, 912, 272, 668 is 4.
Therefore, GCD of numbers 128, 912, 272, 668 is 4
Given Input Data is 128, 912, 272, 668
Make a list of Prime Factors of all the given numbers initially
Prime Factorization of 128 is 2 x 2 x 2 x 2 x 2 x 2 x 2
Prime Factorization of 912 is 2 x 2 x 2 x 2 x 3 x 19
Prime Factorization of 272 is 2 x 2 x 2 x 2 x 17
Prime Factorization of 668 is 2 x 2 x 167
Highest common occurrences in the given inputs are 22
Multiplying them we get the GCD as 4
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(128, 912) = 7296
GCD(128, 912) = ( 128 x 912 ) / 7296
GCD(128, 912) = 116736 / 7296
GCD(128, 912) = 16
Step2:
Here we consider the GCD from the above i.e. 16 as first number and the next as 272
The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)
LCM(16, 272) = 272
GCD(16, 272) = ( 16 x 272 ) / 272
GCD(16, 272) = 4352 / 272
GCD(16, 272) = 16
Step3:
Here we consider the GCD from the above i.e. 16 as first number and the next as 668
The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)
LCM(16, 668) = 2672
GCD(16, 668) = ( 16 x 668 ) / 2672
GCD(16, 668) = 10688 / 2672
GCD(16, 668) = 4
GCD of 128, 912, 272, 668 is 4
Here are some samples of GCD of Numbers calculations.
1. What is the GCD of 128, 912, 272, 668?
GCD of 128, 912, 272, 668 is 4
2. Where do I get the detailed procedure to find GCD of 128, 912, 272, 668?
You can find a detailed procedure to find GCD of 128, 912, 272, 668 on our page.
3. How to find GCD of 128, 912, 272, 668 on a calculator?
You can find the GCD of 128, 912, 272, 668 by simply giving the inputs separated by commas and click on the calculate button to avail the Greatest Common Divisor in less time.