{"id":5051,"date":"2021-12-05T23:00:00","date_gmt":"2021-12-05T17:30:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=5051"},"modified":"2021-12-05T12:17:18","modified_gmt":"2021-12-05T06:47:18","slug":"cpp-program-to-find-prime-factors-of-a-number","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/cpp-program-to-find-prime-factors-of-a-number\/","title":{"rendered":"C++ Program to Find Prime Factors of a Number"},"content":{"rendered":"\n<p>In this post, we will learn<strong> how to find the prime factors of a number using C++<\/strong> Programming language.<\/p>\n\n\n\n<p>Suppose the user enters a number<strong> 18<\/strong>, then it\u2019s prime factors will be <strong>2<\/strong> and <strong>3<\/strong>. We will find the prime factors using the following methods:<\/p>\n\n\n\n<ol><li>Using While Loop<\/li><li>Using for Loop<\/li><\/ol>\n\n\n\n<p>So, without further ado, let\u2019s begin this tutorial.<\/p>\n\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_65 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<label for=\"ez-toc-cssicon-toggle-item-662c33cac1fe8\" class=\"ez-toc-cssicon-toggle-label\"><label class=\"ez-toc-title\">Table of Contents<\/label>\n<span class=\"ez-toc-cssicon\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #0090ff;color:#0090ff\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #0090ff;color:#0090ff\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/label><input type=\"checkbox\"  id=\"ez-toc-cssicon-toggle-item-662c33cac1fe8\" checked \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.codingbroz.com\/cpp-program-to-find-prime-factors-of-a-number\/#C_Program_to_Find_Prime_Factors_of_a_Number\" title=\"C++ Program to Find Prime Factors of a Number\">C++ Program to Find Prime Factors of a Number<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/cpp-program-to-find-prime-factors-of-a-number\/#How_Does_This_Program_Work\" title=\"How Does This Program Work ?\">How Does This Program Work ?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/cpp-program-to-find-prime-factors-of-a-number\/#C_Program_to_Find_Prime_Factors_of_a_Number_Using_For_Loop\" title=\"C++ Program to Find Prime Factors of a Number Using For Loop\">C++ Program to Find Prime Factors of a Number Using For Loop<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/www.codingbroz.com\/cpp-program-to-find-prime-factors-of-a-number\/#Conclusion\" title=\"Conclusion\">Conclusion<\/a><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"C_Program_to_Find_Prime_Factors_of_a_Number\"><\/span><strong>C++ Program to Find Prime Factors of a Number<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\/\/ C++ Program to Find Prime Factors of a Number\n#include &lt;iostream>\nusing namespace std;\n\nint main(){\n    int num, i = 1, j, count;\n    \n    \/\/ Asking for input\n    cout &lt;&lt; \"Enter any number to find prime factors: \";\n    cin >> num;\n    \n    while (i &lt;= num){\n        count = 0;\n        if (num % i == 0){\n            j = 1;\n            while (j &lt;= i){\n                if (i % j == 0){\n                    count++;\n                }\n                j++;\n            }\n            if (count == 2){\n                cout &lt;&lt; i &lt;&lt; \" is a prime factor of \" &lt;&lt; num &lt;&lt; endl;\n            }\n        }\n        i++;\n    }\n    return 0;\n}\n<\/pre>\n\n\n\n<p><strong>Output<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Enter any number to find prime factors: 15\r\n3 is a prime factor of 15\r\n5 is a prime factor of 15\r<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"How_Does_This_Program_Work\"><\/span><strong>How Does This Program Work ?<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">    int num, i = 1, j, count;\n<\/pre>\n\n\n\n<p>In this program, we have declared<strong> four int data type<\/strong> variables named <strong>num<\/strong>,<strong> i<\/strong>,<strong> j<\/strong> and <strong>count<\/strong>.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">    \/\/ Asking for input\n    cout &lt;&lt; \"Enter any number to find prime factors: \";\n    cin >> num;\n<\/pre>\n\n\n\n<p>Then, the user is asked to enter any number to find its prime factors.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">    while (i &lt;= num){\n        count = 0;\n        if (num % i == 0){\n            j = 1;\n            while (j &lt;= i){\n                if (i % j == 0){\n                    count++;\n                }\n                j++;\n            }\n<\/pre>\n\n\n\n<p>We have used a<strong> while loop<\/strong> to find the factors of the entered number.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">            if (count == 2){\n                cout &lt;&lt; i &lt;&lt; \" is a prime factor of \" &lt;&lt; num &lt;&lt; endl;\n            }\n<\/pre>\n\n\n\n<p>We display the prime factors of the entered number with the help of the <strong>cout <\/strong>statement.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"C_Program_to_Find_Prime_Factors_of_a_Number_Using_For_Loop\"><\/span><strong>C++ Program to Find Prime Factors of a Number Using For Loop<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\/\/ C++ Program to Find Prime Factors of a Number\n#include &lt;iostream>\nusing namespace std;\n\nint main(){\n    int num, i, j, count;\n    \n    \/\/ Asking for input\n    cout &lt;&lt; \"Enter any number: \";\n    cin >> num;\n    \n    for (i = 1; i &lt;= num; i++){\n        count = 0;\n        if (num % i == 0){\n            for (j = 1; j &lt;= i; j++){\n                if (i % j == 0){\n                    count++;\n                }\n            }\n        }\n            if (count == 2){\n                cout &lt;&lt; i &lt;&lt; \" is a prime factor of \" &lt;&lt; num &lt;&lt; endl;\n            }\n        }\n    return 0;\n}\n<\/pre>\n\n\n\n<p><strong>Output<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Enter any number: 42\r\n2 is a prime factor of 42\r\n3 is a prime factor of 42\r\n7 is a prime factor of 42\r<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Conclusion\"><\/span><strong>Conclusion<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>I hope after going through this post, you understand<strong> how to find the prime factors of a number using C++ <\/strong>Programming language.<\/p>\n\n\n\n<p>If you have any doubts regarding the program, feel free to contact us in the comment section. We will be delighted to assist you.<\/p>\n\n\n\n<p><strong>Also Read:<\/strong><\/p>\n\n\n\n<ul><li><strong><a href=\"https:\/\/www.codingbroz.com\/cpp-program-to-check-perfect-number\/\">C++ Program to Check Perfect Number<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/cpp-program-to-check-palindrome-number\/\">C++ Program to Check Palindrome Number<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/cpp-program-to-calculate-profit-or-loss\/\">C++ Program to Calculate Profit OR Loss<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/cpp-program-to-generate-multiplication-table\/\">C++ Program to Generate Multiplication Table<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/cpp-program-to-find-product-of-digits-of-a-number\/\">C++ Program to Find Product of Digits of a Number<\/a><\/strong><\/li><\/ul>\n","protected":false},"excerpt":{"rendered":"<p>In this post, we will learn how to find the prime factors of a number using C++ Programming language.<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[168,358],"tags":[362,473,361],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/5051"}],"collection":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=5051"}],"version-history":[{"count":4,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/5051\/revisions"}],"predecessor-version":[{"id":5056,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/5051\/revisions\/5056"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=5051"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=5051"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=5051"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}