What is the Greatest Common Factor of 25948 and 25961?

Greatest common factor (GCF) of 25948 and 25961 is 13.

GCF(25948,25961) = 13

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

How to find the GCF of 25948 and 25961?

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

Step-1: Prime Factorization of 25948

Prime factors of 25948 are 2, 13, 499. Prime factorization of 25948 in exponential form is:

25948 = 2² × 13¹ × 499¹

Step-2: Prime Factorization of 25961

Prime factors of 25961 are 13, 1997. Prime factorization of 25961 in exponential form is:

25961 = 13¹ × 1997¹

Step-3: Factors of 25948

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

1, 2, 4, 13, 26, 52, 499, 998, 1996, 6487, 12974

Step-4: Factors of 25961

List of positive integer factors of 25961 that divides 25948 without a remainder.

1, 13, 1997

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 25948 and 25961. The biggest common factor number is the GCF number.
So the greatest common factor 25948 and 25961 is 13.

Also check out the Least Common Multiple of 25948 and 25961