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 861, 840, 608, 145 i.e. 1 largest integer that divides all the numbers equally.
GCD of 861, 840, 608, 145 is 1
GCD(861, 840, 608, 145) = 1
Ex: 10, 15, 20 (or) 24, 48, 96,45 (or) 78902, 89765, 12345
GCD of numbers 861, 840, 608, 145 is 1
GCD(861, 840, 608, 145) = 1
Given Input numbers are 861, 840, 608, 145
To find the GCD of numbers using factoring list out all the divisors of each number
Divisors of 861
List of positive integer divisors of 861 that divides 861 without a remainder.
1, 3, 7, 21, 41, 123, 287, 861
Divisors of 840
List of positive integer divisors of 840 that divides 840 without a remainder.
1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 15, 20, 21, 24, 28, 30, 35, 40, 42, 56, 60, 70, 84, 105, 120, 140, 168, 210, 280, 420, 840
Divisors of 608
List of positive integer divisors of 608 that divides 608 without a remainder.
1, 2, 4, 8, 16, 19, 32, 38, 76, 152, 304, 608
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 861, 840, 608, 145 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 861, 840, 608, 145 is 1.
Therefore, GCD of numbers 861, 840, 608, 145 is 1
Given Input Data is 861, 840, 608, 145
Make a list of Prime Factors of all the given numbers initially
Prime Factorization of 861 is 3 x 7 x 41
Prime Factorization of 840 is 2 x 2 x 2 x 3 x 5 x 7
Prime Factorization of 608 is 2 x 2 x 2 x 2 x 2 x 19
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(861, 840) = 34440
GCD(861, 840) = ( 861 x 840 ) / 34440
GCD(861, 840) = 723240 / 34440
GCD(861, 840) = 21
Step2:
Here we consider the GCD from the above i.e. 21 as first number and the next as 608
The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)
LCM(21, 608) = 12768
GCD(21, 608) = ( 21 x 608 ) / 12768
GCD(21, 608) = 12768 / 12768
GCD(21, 608) = 1
Step3:
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 861, 840, 608, 145 is 1
Here are some samples of GCD of Numbers calculations.
1. What is the GCD of 861, 840, 608, 145?
GCD of 861, 840, 608, 145 is 1
2. Where do I get the detailed procedure to find GCD of 861, 840, 608, 145?
You can find a detailed procedure to find GCD of 861, 840, 608, 145 on our page.
3. How to find GCD of 861, 840, 608, 145 on a calculator?
You can find the GCD of 861, 840, 608, 145 by simply giving the inputs separated by commas and click on the calculate button to avail the Greatest Common Divisor in less time.