1)Factorial
Int num=
Integer.parseInt(jTextField1.getText());
Int fact=1, a;
For(a=1;a<=num;a++)
{
Fact=fact*a;
}
System.out.println(fact);
2)Sum of digits:
Int
num= Integer.parseInt(jTextField1.getText());
Int
digit, sum=0;
While(num>0)
{
Digit=num%10;
Sum=sum+digit;
Num=num/10;
}
System.out.println(sum);
3) Reversing the digits:
Int
num= Integer.parseInt(jTextField1.getText());
Int
digit, rev=0;
While(num>0)
{
Digit=num%10;
Rev=rev*10+digit;
Num=num/10;
}
System.out.println(rev);
4)Palindrome or not
Int
num= Integer.parseInt(jTextField1.getText());
Int
digit, rev=0;
Int
y=num;
While(num>0)
{
Digit=num%10;
Rev=rev*10+digit;
Num=num/10;
}
If(y==rev)
System.out.println(“ It is a palindrome”);
Else
System.out.println(“ It is not a palindrome”);
5) Armstrong number
Int
num= Integer.parseInt(jTextField1.getText());
Int
digit, sum=0;
Int
y=num;
While(num>0)
{
Digit=num%10;
Sum=sum+(digit*digit*digit);
Num=num/10;
}
If(y==sum)
System.out.println(“ It is an Armstrong number”);
Else
System.out.println(“ It is not a Armstrong number”);
6) Prime number
Int
num= Integer.parseInt(jTextField1.getText());
Int a=1;
For(int
i=2;i<n;i++)
{
If(num%i==0)
{
a=0;
Break;
}}
If(a==1)
System.out.println(“ It is a prime number”);
Else
System.out.println(“ It is not a prime number”);
7) Palindrome of a
string
String a = jTextField1.getText();
int b = a.length();
String c = "";
while (b>=1)
{ String k = a.substring(b-1,b);
c=c.concat(k);
b--;
}
if (a.equals(c))
jTextField2.setText("Palindrome");
else
jTextField2.setText("Not Palindrome");
