* C program to count trailing zeros in a binary number using bitwise

operator */

#include <stdio.h>
#define INT_SIZE sizeof(int) * 8 /* Bits required to represent an integer */

int main()
{
int num, count, i;

/* Input number from user */

printf("Enter any number: ");
scanf("%d", &num);

count = 0;

for(i=0; i<INT_SIZE; i++)

{

if((num >> i ) & 1)

{

break;
}

count++;
}

printf("Total number of trailing zeros in %d is %d.", num, count);

return 0;
}

***********************************************************************************
*************************

/* program to check if the given number is armstrong or not by inputing any digit
number */

#include <stdio.h>

int main()
{
int num,r,sum=0,temp;

printf("Input a number: ");

scanf("%d",&num);

for(temp=num;num!=0;num=num/10)
{
r=num % 10;
sum=sum+(r*r*r);
}
if(sum==temp)
printf("%d is an Armstrong number.\n",temp);
else
printf("%d is not an Armstrong number.\n",temp);
}

***********************************************************************************
*************************

/* program to convert the given decimal number to binary */

#include <iostream>
using namespace std;
int main() {
long n, d, r, binary = 0;
n=10;
d = n;
int temp = 1;
while (n!=0) {
r = n%2;
n = n / 2;
binary = binary + r*temp;
temp = temp * 10;
}
printf("%ld", binary);
return 0;
}

***********************************************************************************
**************************************

/* program to check if the given number is prime or not */

#include <stdio.h>

int main()

{
int n, i, c = 0;
printf("Enter any number n:");
scanf("%d", &n);

for (i = 1; i <= n; i++)

{
if (n % i == 0)
{
c++;
}
}

if (c == 2)
{
printf("n is a Prime number");
}
else
{
printf("n is not a Prime number");
}
 return 0;
}

***********************************************************************************
************************************