{"id":5389,"date":"2022-01-27T23:00:00","date_gmt":"2022-01-27T17:30:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=5389"},"modified":"2022-01-27T18:09:36","modified_gmt":"2022-01-27T12:39:36","slug":"c-program-to-check-krishnamurthy-number","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/c-program-to-check-krishnamurthy-number\/","title":{"rendered":"C Program to Check If the Number is Krishnamurthy Number or Not"},"content":{"rendered":"\n<p>In this post, we will learn<strong> how to check whether a number is Krishnamurthy number or not using C<\/strong> Programming language. But before that, let\u2019s first learn about Krishnamurthy numbers.<\/p>\n\n\n\n<p><strong>Krishnamurthy number <\/strong>is a number which is equal to the sum of the factorials of its digits. For example: <strong>145 <\/strong>is a Krishnamurthy number because <strong>145 = 1! + 4! + 5! = 1 + 24 + 120 = 145<\/strong>.<\/p>\n\n\n\n<p>We will check for krishnamurthy number using the following approaches:<\/p>\n\n\n\n<ol><li>Using For Loop<\/li><li>Using While 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-662d46b0a52c6\" 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-662d46b0a52c6\" 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\/c-program-to-check-krishnamurthy-number\/#C_Program_to_Check_If_the_Number_is_Krishnamurthy_Number_or_Not_Using_For_Loop\" title=\"C Program to Check If the Number is Krishnamurthy Number or Not Using For Loop\">C Program to Check If the Number is Krishnamurthy Number or Not Using For Loop<\/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\/c-program-to-check-krishnamurthy-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\/c-program-to-check-krishnamurthy-number\/#C_Program_to_Check_Krishnamurthy_Number_Using_While_Loop\" title=\"C Program to Check Krishnamurthy Number Using While Loop\">C Program to Check Krishnamurthy Number Using While 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\/c-program-to-check-krishnamurthy-number\/#Conclusion\" title=\"Conclusion\">Conclusion<\/a><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\" id=\"c-program-to-check-if-the-number-is-krishnamurthy-number-or-not-using-for-loop\"><span class=\"ez-toc-section\" id=\"C_Program_to_Check_If_the_Number_is_Krishnamurthy_Number_or_Not_Using_For_Loop\"><\/span><strong>C Program to Check If the Number is Krishnamurthy Number or Not Using For Loop<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\/\/ C Program to Check If the Number is Krishnamurthy Number or Not\n#include &lt;stdio.h>\nint main(){\n    int num, i, rem, temp, fact, sum = 0;\n    \n    \/\/ Asking for input\n    printf(\"Enter a number: \");\n    scanf(\"%d\", &amp;num);\n    \n    for (temp = num; temp > 0; temp = temp\/10){\n        fact = 1;\n        rem = temp % 10;\n        \n        for (i = 1; i &lt;= rem; i++){\n            fact = i * fact;\n        }\n        sum = sum + fact;\n    }\n    \n    \/\/ Checking for krishnamurthy number\n    if (num == sum){\n        printf(\"%d is a krishnamurthy number.\", num);\n    }\n    else{\n        printf(\"%d is not a krishnamurthy number.\", num);\n    }\n    return 0;\n}\n<\/pre>\n\n\n\n<p><strong>Output 1<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Enter a number: 145\r\n145 is a krishnamurthy number.\r<\/code><\/pre>\n\n\n\n<p><strong>Output 2<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Enter a number: 123\r\n123 is not a krishnamurthy number.\r<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"how-does-this-program-work\"><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=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">    int num, i, rem, temp, fact, sum = 0;\n<\/pre>\n\n\n\n<p>In this program, we have declared<strong> 6 integer data type<\/strong> variables named <strong>num<\/strong>,<strong> i<\/strong>, <strong>rem<\/strong>, <strong>temp<\/strong>, <strong>fact<\/strong> and <strong>sum<\/strong>.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">    \/\/ Asking for input\n    printf(\"Enter a number: \");\n    scanf(\"%d\", &amp;num);\n<\/pre>\n\n\n\n<p>The user is asked to enter a number to check for krishnamurthy number.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">    for (temp = num; temp > 0; temp = temp\/10){\n        fact = 1;\n        rem = temp % 10;\n        \n        for (i = 1; i &lt;= rem; i++){\n            fact = i * fact;\n        }\n        sum = sum + fact;\n    }\n<\/pre>\n\n\n\n<p>Suppose the entered number is <strong>145<\/strong>, then:<\/p>\n\n\n\n<p><strong>1st For Loop Iteration: for (temp = 145; 145 > 0; 145 = 145\/10)<\/strong><br>fact = 1<br>rem = 145 % 10 = 5<\/p>\n\n\n\n<p><strong>Now, for (i = 1; i &lt; = 5; i++)<\/strong><\/p>\n\n\n\n<ul><li>After 1st iteration: fact = 1 * 1 = 1<\/li><li>After 2nd iteration: fact = 2 * 1 = 2<\/li><li>After 3rd iteration: fact = 3 * 2 = 6<\/li><li>After 4th iteration: fact = 4 * 6 = 24<\/li><li>After 5th iteration: fact = 5 * 24 = 120<\/li><\/ul>\n\n\n\n<p>So, we get the <strong>sum = sum + fact = 0 + 120 = 120<\/strong>.<\/p>\n\n\n\n<p><strong>2nd For Loop Iteration: for (temp = 14; 14 > 0; 14 = 14\/10)<\/strong><br>fact = 1<br>rem = 14 % 10 = 4<\/p>\n\n\n\n<p><strong>Now, for (i = 1; i &lt; = 4; i++)<\/strong><\/p>\n\n\n\n<ul><li>After 1st iteration: fact = 1 * 1 = 1<\/li><li>After 2nd iteration: fact = 2 * 1 = 2<\/li><li>After 3rd iteration: fact = 3 * 2 = 6<\/li><li>After 4th iteration: fact = 4 * 6 = 24<\/li><\/ul>\n\n\n\n<p>Now, the <strong>sum = sum + fact = 120 + 24 = 144<\/strong>.<\/p>\n\n\n\n<p><strong>3rd For Loop Iteration: for (temp = 1; 1 > 0; 1 = 1\/10)<\/strong><br>fact = 1<br>rem = 1 % 10 = 1<\/p>\n\n\n\n<p><strong>Now, for (i = 1; i &lt; = 4; i++)<\/strong><\/p>\n\n\n\n<ul><li>After 1st iteration: fact = 1 * 1 = <strong>1<\/strong><\/li><\/ul>\n\n\n\n<p>Finally, the <strong>sum becomes = sum + fact = 144 + 1 = 145<\/strong>.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">    \/\/ Checking for krishnamurthy number\n    if (num == sum){\n        printf(\"%d is a krishnamurthy number.\", num);\n    }\n    else{\n        printf(\"%d is not a krishnamurthy number.\", num);\n    }\n<\/pre>\n\n\n\n<p>Now, we check whether the sum of the factorial of the digits is equal to the original number or not.<\/p>\n\n\n\n<p>If the first condition is<strong> True<\/strong>, then we print that the entered number is a<strong> Krishnamurthy number<\/strong>.<\/p>\n\n\n\n<p>Otherwise, we print that the entered number is <strong>not a Krishnamurthy number<\/strong>.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"c-program-to-check-krishnamurthy-number-using-while-loop\"><span class=\"ez-toc-section\" id=\"C_Program_to_Check_Krishnamurthy_Number_Using_While_Loop\"><\/span><strong>C Program to Check Krishnamurthy Number Using While Loop<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\/\/ C Program to Check Krishnamurthy Number Using While Loop\n#include &lt;stdio.h>\nint main(){\n    int num, rem, fact, temp, sum = 0;\n    \n    \/\/ Asking for input\n    printf(\"Enter a number: \");\n    scanf(\"%d\", &amp;num);\n    \n    \/\/ Assigning a temporary variable\n    temp = num;\n    \n    while (temp != 0){\n        rem = temp % 10;\n        fact = 1;\n        \n        \/\/ Finding factorial of the remainder\n        for (int i = 1; i &lt;= rem; i++){\n            fact = i * fact;\n        }\n        sum = sum + fact;\n        temp = temp \/ 10;\n    }\n    \n    \/\/ Checking krishnamurthy number\n    if (num == sum){\n        printf(\"%d is a krishnamurthy number.\", num);\n    }\n    else{\n        printf(\"%d is not a krishnamurthy number.\", num);\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 a number: 40585\r\n40585 is a krishnamurthy number.\r<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"conclusion\"><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 check whether a number is a Krishnamurthy number or not using C<\/strong> Programming language.<\/p>\n\n\n\n<p>If you have any doubt regarding the program, then 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\/c-program-to-check-armstrong-number\/\">C Program To Check Armstrong Number<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/c-program-to-display-fibonacci-sequence\/\">C Program To Display Fibonacci Sequence<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/c-program-to-calculate-generic-root-of-a-number\/\">C Program to Calculate Generic Root of a Number<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/c-program-to-calculate-gross-salary-of-an-employee\/\">C Program to Calculate Gross Salary of an Employee<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/c-program-to-display-armstrong-number-between-two-intervals\/\">C Program To Display Armstrong Number Between Two Intervals<\/a><\/strong><\/li><\/ul>\n","protected":false},"excerpt":{"rendered":"<p>his post, we will learn how to check whether a number is Krishnamurthy number or not using C Programming language. But before that, let\u2019s first learn about Krishnamurthy numbers.<\/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":[167,294],"tags":[222,550,206],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/5389"}],"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=5389"}],"version-history":[{"count":5,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/5389\/revisions"}],"predecessor-version":[{"id":5397,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/5389\/revisions\/5397"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=5389"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=5389"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=5389"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}