What is the Greatest Common Factor of 68935 and 68948?

Greatest common factor (GCF) of 68935 and 68948 is 1.

GCF(68935,68948) = 1

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

How to find the GCF of 68935 and 68948?

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

Step-1: Prime Factorization of 68935

Prime factors of 68935 are 5, 17, 811. Prime factorization of 68935 in exponential form is:

68935 = 5¹ × 17¹ × 811¹

Step-2: Prime Factorization of 68948

Prime factors of 68948 are 2, 11, 1567. Prime factorization of 68948 in exponential form is:

68948 = 2² × 11¹ × 1567¹

Step-3: Factors of 68935

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

1, 5, 17, 85, 811, 4055, 13787

Step-4: Factors of 68948

List of positive integer factors of 68948 that divides 68935 without a remainder.

1, 2, 4, 11, 22, 44, 1567, 3134, 6268, 17237, 34474

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 68935 and 68948