{"id":10866,"date":"2026-11-02T02:02:53","date_gmt":"2026-11-02T02:02:53","guid":{"rendered":"https:\/\/kapdec.com\/help\/?p=10866"},"modified":"2026-11-02T02:02:53","modified_gmt":"2026-11-02T02:02:53","slug":"prime-factorization-hcf-lcm","status":"publish","type":"post","link":"https:\/\/kapdec.com\/help\/prime-factorization-hcf-lcm\/","title":{"rendered":"Prime Factorization, Hcf & Lcm"},"content":{"rendered":"
\n
\n

KAPDEC® | Elite STEM Learning Platform | https:\/\/kapdec.com<\/a><\/p>\n

\n

Unit<\/strong>: Number System<\/h2>\n

Chapter<\/strong>: Prime Factorization, HCF & LCM
\n\u00a0<\/h3>\n

Reference<\/strong>: \u2013 Prime Factorization (Factor Tree & Division Methods), Highest Common Factor (HCF\/GCD), Lowest Common Multiple (LCM), HCF and LCM by Prime Factorization, Relationship Between HCF and LCM, Properties of HCF and LCM, Real-Life Applications<\/em>
\n\u00a0<\/p>\n

After studying this chapter, you should be able to understand:
\n\u00a0<\/p>\n

    \n
  • Prime Factorization & Its Methods<\/li>\n
  • Highest Common Factor (HCF) & How to Find It<\/li>\n
  • Lowest Common Multiple (LCM) & How to Find It<\/li>\n
  • Finding HCF and LCM by Prime Factorization<\/li>\n
  • Relationship Between HCF and LCM<\/li>\n
  • Properties of HCF and LCM<\/li>\n
  • Real-Life Applications of HCF and LCM<\/li>\n<\/ul>\n

    Prime Factorization<\/strong><\/p>\n

    \u00a0<\/p>\n

    When we express a composite number as a product of prime numbers, it is called prime factorization.<\/strong> The set of prime numbers are called the prime factors<\/strong> of the given number.<\/p>\n

    \u00a0<\/p>\n

    Example-<\/strong>Let us take a number 24.<\/p>\n

    Factors of 24 = 1, 2, 3, 4, 6, 8, 12 and 24.<\/p>\n

    \u00a0<\/p>\n

    Out of these factors, the prime factors are 2 and 3.<\/p>\n

    Now, let us express 24 as a product of its prime factors.<\/p>\n

    \u00a0<\/p>\n

    So, 24 = 2 \u00d7 2 \u00d7 2 \u00d7 3<\/p>\n

    \u00a0<\/p>\n

    Thus, prime factorization<\/strong> is expressing a number as a product of its prime factors.<\/p>\n

    \"\"<\/p>\n

    Source: Kapdec.com<\/p>\n<\/div>\n

    \u00a0<\/p>\n

    \u00a0<\/p>\n

    Method 1: Factor Tree Method<\/strong><\/p>\n

    \u00a0<\/p>\n

      \n
    • In this method, we start splitting the given numbers into factors until we cannot split anymore.<\/li>\n<\/ul>\n

      \u00a0<\/p>\n

        \n
      • The factor that cannot be split anymore i.e. the prime factor is carried down as it is whereas the composite factor is further split in the next step till it becomes prime.<\/li>\n
      • Then, all the prime factors of the number are stated in product form to define the actual number.<\/li>\n<\/ul>\n

        \u00a0<\/p>\n

          \n
        • The standard way of listing the prime factors is from smallest number to the largest one.<\/li>\n<\/ul>\n

          \u00a0<\/p>\n

          Example <\/strong>\u2013 Find the prime factorization of 60.<\/p>\n

          \"\"<\/p>\n

          Source: Kapdec.com<\/p>\n<\/div>\n

          \u00a0<\/p>\n

          Thus, 60 = 2 \u00d7 2 \u00d7 3 \u00d7 5<\/p>\n

          \u00a0<\/p>\n

          #The given number can be treated as a stem while its breakup into prime factors can be treated as its branches.<\/p>\n

          \u00a0<\/p>\n

          \u00a0<\/p>\n

          Method 2: Short Division Method<\/strong><\/p>\n

          \u00a0<\/p>\n

            \n
          • In this method, first we divide the given number by a smallest prime number which completely divides the given number.<\/li>\n<\/ul>\n

            \u00a0<\/p>\n

              \n
            • Then, we divide the quotient again with a smallest prime number or the next smallest prime number which can completely divide the number.<\/li>\n<\/ul>\n

              \u00a0<\/p>\n

                \n
              • We repeat the above step again and again, till the quotient becomes 1.<\/li>\n
              • The product of all the divisors that we got through the above step gives us the number itself and are thereby the prime factors of the number.<\/li>\n<\/ul>\n

                \u00a0<\/p>\n

                Example <\/strong>\u2013 Find the prime factorization of 72.<\/p>\n

                \u00a0<\/p>\n

                \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <\/p>\n

                \"\"<\/p>\n

                Source: Kapdec.com<\/p>\n<\/div>\n

                Thus, 72 = 2 \u00d7 2 \u00d7 2 \u00d7 3 \u00d7 3<\/p>\n

                \u00a0<\/p>\n

                \u00a0<\/p>\n

                <\/p>\n