C Program to Reverse a Number and Preserve Trailing Zeros

January 03, 2026

C Program to Check Prime Number Using Efficient Logic

Introduction A prime number is a number that has exactly two distinct positive divisors: 1 and itself. In this program, we check whether a given number is prime or not using a simple and efficient logic. This type of program is commonly used in mathematics, competitive programming, and basic algorithm learning for beginners in C programming. Problem Statement The task is to write a C program that determines whether a given integer is a prime number or not. The program takes a single integer input from the user and analyzes its divisibility. If the number has no divisors other than 1 and itself, it should be identified as a prime number; otherwise, it is not prime. This problem is important in number theory and has practical relevance in areas such as cryptography, data validation, and algorithm design. Algorithm / Logic Explanation To check whether a number is prime, we need to verify that it is not divisible by any number other than 1 and itself. The algorithm follows a si...

🔁 C Program to Reverse a Number and Preserve Trailing Zeros

#include<stdio.h> int main( ) { int num,reverse=0,original,zero=0,remainder; printf("Enter the number:\n"); scanf("%d",&num); original=num; while(original%10==0&&original!=0) { zero++; original=original/10; } while(num!=0) { remainder=num%10; reverse=reverse*10+remainder; num=num/10; } printf("Reversed Number is:%d",reverse); for(int i=0;i<zero;i++) { printf("0"); } printf("\n"); }

📝 Explanation:

This program reverses a number while preserving its trailing zeros. For example, 54000 becomes 45 followed by three zeros → Reversed Number is: 45 000.

💡 Sample Output:

Enter the number: 54000 Reversed Number is:45 000

🔍 Keywords:

reverse number in C, trailing zeros in reverse, reverse integer with zeros, C programming reverse digits, C reverse number program

Search This Blog

1PRINTF

Featured

C Program to Check Prime Number Using Efficient Logic