GCD of 389, 126, 46 Calculator

Given Input numbers are 389, 126, 46

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

Divisors of 389

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

1, 389

Divisors of 126

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

1, 2, 3, 6, 7, 9, 14, 18, 21, 42, 63, 126

Divisors of 46

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

1, 2, 23, 46

Greatest Common Divisior

We found the divisors of 389, 126, 46 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 389, 126, 46 is 1.

Therefore, GCD of numbers 389, 126, 46 is 1

Given Input Data is 389, 126, 46

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

Prime Factorization of 389 is 389

Prime Factorization of 126 is 2 x 3 x 3 x 7

Prime Factorization of 46 is 2 x 23

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(389, 126) = 49014

GCD(389, 126) = ( 389 x 126 ) / 49014

GCD(389, 126) = 49014 / 49014

GCD(389, 126) = 1

Step2:

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

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

LCM(1, 46) = 46

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

GCD(1, 46) = 46 / 46

GCD(1, 46) = 1

GCD of 389, 126, 46 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 390, 957, 85
• GCD of 729, 333, 43
• GCD of 588, 120, 25
• GCD of 437, 909, 69
• GCD of 722, 890, 55

1. What is the GCD of 389, 126, 46?

GCD of 389, 126, 46 is 1

2. Where do I get the detailed procedure to find GCD of 389, 126, 46?

You can find a detailed procedure to find GCD of 389, 126, 46 on our page.

3. How to find GCD of 389, 126, 46 on a calculator?

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