Advertisements
Advertisements
Question
Express the number as a product of its prime factor:
156
Advertisements
Solution

∴ 156 = 2 × 2 × 3 × 13
= 22 × 3 × 13
APPEARS IN
RELATED QUESTIONS
Consider the number 12n where n is a natural number. Check whether there is any value of n ∈ N for which 12n ends with the digital zero.
Find the LCM and HCF of the following integers by applying the prime factorisation method.
12, 15 and 21
What is the HCF of the smallest prime number and the smallest composite number?
Find the LCM and HCF of the following integers by applying the prime factorisation method:
84, 90 and 120
Write the exponent of 2 in the price factorization of 144.
Express the number as a product of its prime factor:
7429
Find the H.C.F. of 252525 and 363636
Find the L.C.M. and H.C.F. of 408 and 170 by applying the fundamental theorem of Arithmetic
Find the least positive value of x such that 89 ≡ (x + 3) (mod 4)
The sum of the exponents of the prime factors in the prime factorization of 1729 is
The product of two consecutive natural numbers is always ______.
If LCM(x, 18) = 36 and HCF(x, 18) = 2, then x is ______.
The largest number which divides 70 and 125, leaving remainders 5 and 8, respectively, is ______.
If two positive integers a and b are written as a = x3 y2 and b = xy3; x, y are prime numbers, then HCF (a, b) is ______.
If two positive integers p and q can be expressed as p = ab2 and q = a3b; a, b being prime numbers, then LCM (p, q) is ______.
On a morning walk, three persons step off together and their steps measure 40 cm, 42 cm and 45 cm, respectively. What is the minimum distance each should walk so that each can cover the same distance in complete steps?
Let a and b be two positive integers such that a = p3q4 and b = p2q3, where p and q are prime numbers. If HCF (a, b) = pmqn and LCM (a, b) = prqs, then (m + n)(r + s) = ______.
Find the HCF and LCM of 72 and 120.
The prime factorisation of the number 2304 is ______.
The HCF of the smallest 2-digit number and the smallest composite number is ______.
