What is the Greatest Common Factor of 46953 and 46964?

Greatest common factor (GCF) of 46953 and 46964 is 1.

GCF(46953,46964) = 1

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

How to find the GCF of 46953 and 46964?

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

Step-1: Prime Factorization of 46953

Prime factors of 46953 are 3, 37, 47. Prime factorization of 46953 in exponential form is:

46953 = 3³ × 37¹ × 47¹

Step-2: Prime Factorization of 46964

Prime factors of 46964 are 2, 59, 199. Prime factorization of 46964 in exponential form is:

46964 = 2² × 59¹ × 199¹

Step-3: Factors of 46953

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

1, 3, 9, 27, 37, 47, 111, 141, 333, 423, 999, 1269, 1739, 5217, 15651

Step-4: Factors of 46964

List of positive integer factors of 46964 that divides 46953 without a remainder.

1, 2, 4, 59, 118, 199, 236, 398, 796, 11741, 23482

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 46953 and 46964