What is the Greatest Common Factor of 46952 and 46968?

Greatest common factor (GCF) of 46952 and 46968 is 8.

GCF(46952,46968) = 8

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

How to find the GCF of 46952 and 46968?

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

Step-1: Prime Factorization of 46952

Prime factors of 46952 are 2, 5869. Prime factorization of 46952 in exponential form is:

46952 = 2³ × 5869¹

Step-2: Prime Factorization of 46968

Prime factors of 46968 are 2, 3, 19, 103. Prime factorization of 46968 in exponential form is:

46968 = 2³ × 3¹ × 19¹ × 103¹

Step-3: Factors of 46952

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

1, 2, 4, 8, 5869, 11738, 23476

Step-4: Factors of 46968

List of positive integer factors of 46968 that divides 46952 without a remainder.

1, 2, 3, 4, 6, 8, 12, 19, 24, 38, 57, 76, 103, 114, 152, 206, 228, 309, 412, 456, 618, 824, 1236, 1957, 2472, 3914, 5871, 7828, 11742, 15656, 23484

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 46952 and 46968. The biggest common factor number is the GCF number.
So the greatest common factor 46952 and 46968 is 8.

Also check out the Least Common Multiple of 46952 and 46968