











C++ Program to find the sum of digits of a number
Algorithm:-
- Take int number as input and store it in num
- To extract digits we have to use modulus operator (num%10) will give us digit at unit place
- for subsequent digits we have to update num as num=num/10, so unit digit will get removed from number
- Initialize sum=0
- A do while loop is started
- Value of sum is incremented by remainder of num divide by 10 i.e. num % 10
sum+=num%10;
- Divide num by 10 and store result in num itself
num=num/10;
- Do this until num is not equal to 0
while(num!=0);
- sum is printed which is the output
C++ Code:-
//C++ Program
//Sum of digits in a number
#include
using namespace std;
int main()
{
int num,sum=0;
cout<<“Enter any num : “;
//user input
cin>>num;
//loop to find sum of digits
do
{
sum+=num%10;
num=num/10;
}while(num!=0);
//output
cout<<“\nSum of digits in given integer is: “<<sum;
return 0;
}
Output:
Enter any num : 83625
sum of digits in given integer is: 24
- Positive or Negative number: C | C++ | Java
- Even or Odd number: C | C++ | Java
- Sum of First N Natural numbers: C | C++ | Java
- Sum of N natural numbers: C | C++ | Java
- Sum of numbers in a given range: C | C++ | Java
- Greatest of two numbers: C | C++ | Java
- Greatest of the Three numbers: C | C++ | Java
- Leap year or not: C | C++ | Java
- Prime number: C | C++ | Java
- Prime number within a given range: C | C++ | Java
- Factorial of a number: C | C++ | Java
- Sum of digits of a number: C | C++ | Java
- Reverse of a number : C | C++ | Java
- Palindrome number: C | C++ | Java
- Armstrong number : C | C++ | Java
- Armstrong number in a given range : C | C++ | Java
- Fibonacci Series upto nth term : C | C++ | Java
- Factorial of a number : C | C++ | Java
- Power of a number : C | C++ | Java
- Factor of a number : C | C++ | Java
- Strong number : C | C++ | Java
- Perfect number : C | C++ | Java
- Automorphic number : C | C++ | Java
- Harshad number : C | C++ | Java
- Abundant number : C| C++ | Java
- Friendly pair : C | C++ | Java

