GCD of 907, 393, 148 Calculator

Given Input numbers are 907, 393, 148

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

Divisors of 907

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

1, 907

Divisors of 393

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

1, 3, 131, 393

Divisors of 148

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

1, 2, 4, 37, 74, 148

Greatest Common Divisior

We found the divisors of 907, 393, 148 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 907, 393, 148 is 1.

Therefore, GCD of numbers 907, 393, 148 is 1

Given Input Data is 907, 393, 148

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

Prime Factorization of 907 is 907

Prime Factorization of 393 is 3 x 131

Prime Factorization of 148 is 2 x 2 x 37

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(907, 393) = 356451

GCD(907, 393) = ( 907 x 393 ) / 356451

GCD(907, 393) = 356451 / 356451

GCD(907, 393) = 1

Step2:

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

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

LCM(1, 148) = 148

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

GCD(1, 148) = 148 / 148

GCD(1, 148) = 1

GCD of 907, 393, 148 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 611, 684, 835
• GCD of 182, 377, 712
• GCD of 879, 992, 673
• GCD of 604, 154, 883
• GCD of 505, 630, 668

1. What is the GCD of 907, 393, 148?

GCD of 907, 393, 148 is 1

2. Where do I get the detailed procedure to find GCD of 907, 393, 148?

You can find a detailed procedure to find GCD of 907, 393, 148 on our page.

3. How to find GCD of 907, 393, 148 on a calculator?

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