Here you will learn how to convert binary to decimal in C++. We can convert a binary number into decimals in the following way. Also Read: Convert Decimal to Binary in C++ C++ Program to Convert Binary to Decimal Output: Enter any Binary number:111The Decimal conversion of 111 is 7
Here you will get the program to convert a number from decimal to binary in C++. How to convert decimal numbers to binary? This program can only convert nondecimal numbers. Also Read: Convert Binary to Decimal in C++ C++ Program to Convert Decimal to Binary Output: Enter a number:5The binary conversion of 5 is 101
Here is the C++ program to print first 10 prime numbers. #include<iostream> using namespace std; int main() { int i,j,count=1,b=0; cout<<“First Ten Prime Numbers Are\n”<<“2”; for(i=3;i>0;++i) { for(j=2;j<=i/2;++j) { if(i%j==0){ b=1; break; } } if(b==0) { cout<<“\n”<<i; count++; } b=0; if(count==10) break; } return 0; } Output First Ten Prime Numbers Are 2 3 5 …
A series in which each number is the sum of the preceding two numbers is called the Fibonacci series. For example 0 1 1 2 3 5 8 13 . . . . . Below is the program to find Fibonacci series in C++. Output: How many numbers?5Fibonacci series0 1 1 2 3
This C++ program will find the sum of squares of n natural numbers. Starting from 1, 2, 3, etc are called natural numbers. For example: n = 3 Then, Sum = 12 + 22 + 32 = 14 Output: Enter any number: 50Sum=42925
Here you will get a C++ program to check whether a number is a palindrome or not. A number is a palindrome if it is equal to its reverse. For example, 121 is a palindrome because if we reverse the order of digits then the number so obtained is equal to the original number. Output: …
Below is the C++ program to find all the divisors of a number. A divisor is a number that divides another number completely. For example, D is the divisor of N if N%D=0. Output: Enter the number: 6Divisors of 6 are 1 2 3 6
Below I have shared a C++ program to find the sum of the digits of a number. For example, given number is 238 then the sum of digits will be 13. I am using very simple logic. If we find the mod of any number by 10 then the result is the last digit of …
