What is the Greatest Common Factor of 60961 and 60968?

Greatest common factor (GCF) of 60961 and 60968 is 1.

GCF(60961,60968) = 1

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

How to find the GCF of 60961 and 60968?

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

Step-1: Prime Factorization of 60961

Prime factors of 60961 are 60961. Prime factorization of 60961 in exponential form is:

60961 = 60961¹

Step-2: Prime Factorization of 60968

Prime factors of 60968 are 2, 7621. Prime factorization of 60968 in exponential form is:

60968 = 2³ × 7621¹

Step-3: Factors of 60961

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

Step-4: Factors of 60968

List of positive integer factors of 60968 that divides 60961 without a remainder.

1, 2, 4, 8, 7621, 15242, 30484

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 60961 and 60968