A palindromic number is a number that remains the same even when its digits are reversed. For example, 121, 99, 101 are palindromic numbers. If you want to learn how to check whether a number is a palindrome or not using the C++ programming language, this article is for you. In this article, I’ll show you a tutorial on how to check palindrome numbers using C++.

## Check Palindrome Numbers using C++

Palindrome refers to a word whose spelling is unchanged if the letters of the word are reversed. Just like a palindrome word, a palindrome number is a number that remains unchanged even if the digits are reversed. To write a C++ program to check whether a number is palindrome or not, we need to invert the number and check whether or not the inverted number is equal to the original number. So here’s how to check palindrome numbers using C++:

Enter a Number to Check If It is Palindrome or not: 121 Yes, it is a Palindrome Number!

In the above code, I have declared three variables in the beginning:

- n, for taking a user input;
- count, to count the number of digits in the number;
- reverse, to reverse and store the reversed number.

Then, I am taking user input, and after taking user input, I declared the initial value of reverse as 0 and stored the value of n in an integer variable i.

Then, I am using a do-while loop to invert the number, and then I am checking if the inverted number is equal to the original number or not. If the two numbers are equal, the program will show that the number entered by the user is palindromic, and if the two numbers are not equal, the program will show that the number entered by the user is not a palindrome number.

Also, Read – C++ Programs for beginners with Code.

### Summary

Palindrome refers to a word whose spelling is unchanged if the letters of the word are reversed. Just like a palindrome word, a palindrome number is a number that remains unchanged even if the digits are reversed. I hope you liked this article on how to check palindrome numbers using C++. Feel free to ask your valuable questions in the comments section below.