GCD of 398, 645, 769 Calculator

Given Input numbers are 398, 645, 769

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

Divisors of 398

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

1, 2, 199, 398

Divisors of 645

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

1, 3, 5, 15, 43, 129, 215, 645

Divisors of 769

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

1, 769

Greatest Common Divisior

We found the divisors of 398, 645, 769 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 398, 645, 769 is 1.

Therefore, GCD of numbers 398, 645, 769 is 1

Given Input Data is 398, 645, 769

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

Prime Factorization of 398 is 2 x 199

Prime Factorization of 645 is 3 x 5 x 43

Prime Factorization of 769 is 769

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(398, 645) = 256710

GCD(398, 645) = ( 398 x 645 ) / 256710

GCD(398, 645) = 256710 / 256710

GCD(398, 645) = 1

Step2:

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

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

LCM(1, 769) = 769

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

GCD(1, 769) = 769 / 769

GCD(1, 769) = 1

GCD of 398, 645, 769 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 408, 927, 821
• GCD of 657, 946, 160
• GCD of 356, 484, 242
• GCD of 820, 924, 115
• GCD of 877, 398, 296

1. What is the GCD of 398, 645, 769?

GCD of 398, 645, 769 is 1

2. Where do I get the detailed procedure to find GCD of 398, 645, 769?

You can find a detailed procedure to find GCD of 398, 645, 769 on our page.

3. How to find GCD of 398, 645, 769 on a calculator?

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