A day full of math games & activities. Find one near you.

HCF of 1650 and 847

HCF of 1650 and 847 is the largest possible number that divides 1650 and 847 exactly without any remainder. The factors of 1650 and 847 are 1, 2, 3, 5, 6, 10, 11, 15, 22, 25, 30, 33, 50, 55, 66, 75, 110, 150, 165, 275, 330, 550, 825, 1650 and 1, 7, 11, 77, 121, 847 respectively. There are 3 commonly used methods to find the HCF of 1650 and 847 - Euclidean algorithm, prime factorization, and long division.

1.	HCF of 1650 and 847
2.	List of Methods
3.	Solved Examples
4.	FAQs

What is HCF of 1650 and 847?

Answer: HCF of 1650 and 847 is 11.

Explanation:

The HCF of two non-zero integers, x(1650) and y(847), is the highest positive integer m(11) that divides both x(1650) and y(847) without any remainder.

Methods to Find HCF of 1650 and 847

The methods to find the HCF of 1650 and 847 are explained below.

Listing Common Factors
Long Division Method
Prime Factorization Method

HCF of 1650 and 847 by Listing Common Factors

Factors of 1650: 1, 2, 3, 5, 6, 10, 11, 15, 22, 25, 30, 33, 50, 55, 66, 75, 110, 150, 165, 275, 330, 550, 825, 1650
Factors of 847: 1, 7, 11, 77, 121, 847

There are 2 common factors of 1650 and 847, that are 1 and 11. Therefore, the highest common factor of 1650 and 847 is 11.

HCF of 1650 and 847 by Long Division

HCF of 1650 and 847 is the divisor that we get when the remainder becomes 0 after doing long division repeatedly.

Step 1: Divide 1650 (larger number) by 847 (smaller number).
Step 2: Since the remainder ≠ 0, we will divide the divisor of step 1 (847) by the remainder (803).
Step 3: Repeat this process until the remainder = 0.

The corresponding divisor (11) is the HCF of 1650 and 847.

HCF of 1650 and 847 by Prime Factorization

Prime factorization of 1650 and 847 is (2 × 3 × 5 × 5 × 11) and (7 × 11 × 11) respectively. As visible, 1650 and 847 have only one common prime factor i.e. 11. Hence, the HCF of 1650 and 847 is 11.

☛ Also Check:

HCF of 1650 and 847 Examples

Example 1: Find the HCF of 1650 and 847, if their LCM is 127050.

Solution:

∵ LCM × HCF = 1650 × 847
⇒ HCF(1650, 847) = (1650 × 847)/127050 = 11
Therefore, the highest common factor of 1650 and 847 is 11.
Example 2: Find the highest number that divides 1650 and 847 exactly.

Solution:

The highest number that divides 1650 and 847 exactly is their highest common factor, i.e. HCF of 1650 and 847.
⇒ Factors of 1650 and 847:
- Factors of 1650 = 1, 2, 3, 5, 6, 10, 11, 15, 22, 25, 30, 33, 50, 55, 66, 75, 110, 150, 165, 275, 330, 550, 825, 1650
- Factors of 847 = 1, 7, 11, 77, 121, 847
Therefore, the HCF of 1650 and 847 is 11.
Example 3: For two numbers, HCF = 11 and LCM = 127050. If one number is 847, find the other number.

Solution:

Given: HCF (z, 847) = 11 and LCM (z, 847) = 127050
∵ HCF × LCM = 847 × (z)
⇒ z = (HCF × LCM)/847
⇒ z = (11 × 127050)/847
⇒ z = 1650
Therefore, the other number is 1650.

go to slide go to slide go to slide

Ready to see the world through math’s eyes?

Math is at the core of everything we do. Enjoy solving real-world math problems in live classes and become an expert at everything.

Book a Free Trial Class

FAQs on HCF of 1650 and 847

What is the HCF of 1650 and 847?

The HCF of 1650 and 847 is 11. To calculate the HCF (Highest Common Factor) of 1650 and 847, we need to factor each number (factors of 1650 = 1, 2, 3, 5, 6, 10, 11, 15, 22, 25, 30, 33, 50, 55, 66, 75, 110, 150, 165, 275, 330, 550, 825, 1650; factors of 847 = 1, 7, 11, 77, 121, 847) and choose the highest factor that exactly divides both 1650 and 847, i.e., 11.

How to Find the HCF of 1650 and 847 by Long Division Method?

To find the HCF of 1650, 847 using long division method, 1650 is divided by 847. The corresponding divisor (11) when remainder equals 0 is taken as HCF.

If the HCF of 847 and 1650 is 11, Find its LCM.

HCF(847, 1650) × LCM(847, 1650) = 847 × 1650
Since the HCF of 847 and 1650 = 11
⇒ 11 × LCM(847, 1650) = 1397550
Therefore, LCM = 127050
☛ Highest Common Factor Calculator

What are the Methods to Find HCF of 1650 and 847?

There are three commonly used methods to find the HCF of 1650 and 847.

By Prime Factorization
By Long Division
By Euclidean Algorithm

How to Find the HCF of 1650 and 847 by Prime Factorization?

To find the HCF of 1650 and 847, we will find the prime factorization of the given numbers, i.e. 1650 = 2 × 3 × 5 × 5 × 11; 847 = 7 × 11 × 11.
⇒ Since 11 is the only common prime factor of 1650 and 847. Hence, HCF (1650, 847) = 11.
☛ What is a Prime Number?

What is the Relation Between LCM and HCF of 1650, 847?

The following equation can be used to express the relation between Least Common Multiple (LCM) and HCF of 1650 and 847, i.e. HCF × LCM = 1650 × 847.

Download FREE Study Materials

HCF and LCM

Math worksheets and
visual curriculum