What is the Greatest Common Factor of 19683 and 19690?

Greatest common factor (GCF) of 19683 and 19690 is 1.

GCF(19683,19690) = 1

We will now calculate the prime factors of 19683 and 19690, than find the greatest common factor (greatest common divisor (gcd)) of the numbers by matching the biggest common factor of 19683 and 19690.

How to find the GCF of 19683 and 19690?

We will first find the prime factorization of 19683 and 19690. After we will calculate the factors of 19683 and 19690 and find the biggest common factor number .

Step-1: Prime Factorization of 19683

Prime factors of 19683 are 3. Prime factorization of 19683 in exponential form is:

19683 = 3⁹

Step-2: Prime Factorization of 19690

Prime factors of 19690 are 2, 5, 11, 179. Prime factorization of 19690 in exponential form is:

19690 = 2¹ × 5¹ × 11¹ × 179¹

Step-3: Factors of 19683

List of positive integer factors of 19683 that divides 19683 without a remainder.

1, 3, 9, 27, 81, 243, 729, 2187, 6561

Step-4: Factors of 19690

List of positive integer factors of 19690 that divides 19683 without a remainder.

1, 2, 5, 10, 11, 22, 55, 110, 179, 358, 895, 1790, 1969, 3938, 9845

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 19683 and 19690. The biggest common factor number is the GCF number.
So the greatest common factor 19683 and 19690 is 1.

Also check out the Least Common Multiple of 19683 and 19690