1.

HEX TO DEC
import [Link].*;
class DeciHex {
String Hex = "";
void hex(int deci) {
if (deci != 0) {
int k = 0;
char hex[] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E',
'F'};
k = deci % 16;
Hex = hex[k] + Hex;
deci /= 16;
hex(deci);
}
}
public static void main(String[] args) {
DeciHex ob = new DeciHex();
[Link](4557);
[Link]([Link]);
}
}
2. Evil Number using recursion
import [Link].*;
class Evil {
int bin=0;
int binary(int deci) {
if (deci==0)
return 0;
else{
bin=(deci%2)+10;
return bin* binary(deci/2);
}
}
public static void main(String[] args) {
Evil ob=new Evil();
int c=0;
int k=[Link](17);
while(k>0){
if(k%10==1)
c=c+1;
k/=10;
}
if (c%2==0)
[Link]("ITS AN EVIL NUMBER");
else
[Link]("NOT AN EVIL NUMBER");
}
}
[Link] NO.
import [Link];
public class Pronic {
public static boolean isPronic(int n) {
int sqrt = (int) [Link](n);
 return (n == sqrt * (sqrt + 1)) || (n == (sqrt - 1) * sqrt);
}
public static void main(String[] args) {
Scanner scanner = new Scanner([Link]);
[Link]("Enter a number: ");
int number = [Link]();
if (isPronic(number)) {
[Link](number + " is a pronic number.");
} else {
[Link](number + " is not a pronic number.");
} }}
[Link]
import [Link].*;
class palin
{
static int rev(int n, int temp)
{
if (n == 0)
return temp;
temp = (temp * 10) + (n % 10);
return rev(n / 10, temp);
}
public static void main (String[] args)
{
int n = 121;
int temp = rev(n, 0);
 if (temp == n)
[Link]("yes");
else
[Link]("no" );
}
}
[Link]
import [Link];
class Disarium{
int num; int size;
public Disarium(int nn){
num = nn; size = 0;
}
public void countDigit(){
size = [Link](num).length();
}
public int sumofDigits(int n, int p){
if(n < 10)
return n;
int term = (int)[Link](n % 10, p);
return term + sumofDigits(n / 10, p - 1);
}
public void check(){
if(num == sumofDigits(num, size))
[Link]("Disarium number!");
else
[Link]("Not a disarium number.");
}
public static void main(String[] args){
Scanner in = new Scanner([Link]);
[Link]("Enter the number: ");
int n = [Link]([Link]());
Disarium obj = new Disarium(n);
[Link]();
[Link]();
}
6. Dudeney no.
import [Link];
public class NumDude
{
int num;
public NumDude()
{
num=0;
}
public void input()
{
Scanner in = new Scanner([Link]); [Link]("Enter the number:
");
num = [Link]();
}
public int sumDigits (int x)
{
if (x==0)
return 0;
else
return x%10 +sumDigits (x/10);
}
public void isDude()
{
int sdig=sumDigits (num);
if((sdig*sdig*sdig)== num)
[Link]("Dudency number ");
else
[Link]("Not a Dudency number ");
}
public static void main(String args[]) {
NumDude ob=new NumDude();
[Link]();
[Link]();
}}
[Link]
class Main {
static int gcd(int a, int b) {
if (a == 0) return b;
return gcd(b % a, a);
}
static int lcm(int a, int b) {
return (a / gcd(a, b)) * b;
 }
public
static void main(String[] args) {
int a = 15, b = 20;
[Link]("LCM of " + a + " and " + b + " is " + lcm(a, b));
}
}
[Link]
public class Main
{
static int gcd(int num1, int num2)
{
if (num1 == 0)
return num2;
if (num2 == 0)
return num1;
if (num1 == num2)
return num1;
if (num1 > num2)
return gcd(num1-num2, num2);
return gcd(num1, num2-num1);
}
public static void main(String[] args)
{
int num1 = 98, num2 = 56;
[Link]("GCD of " + num1 +" and " + num2 + " is " +
gcd(num1, num2));
 }
}
[Link] NUMBER
import [Link];
class Perfect{
int num;
public Perfect(int nn){
num = nn;
}
public int sum_of_factors(int i){
if(i > num / 2)
return 0;
if(num % i == 0)
return i + sum_of_factors(i + 1);
return sum_of_factors(i + 1);
}
public void check(){
if(num == sum_of_factors(1))
[Link]("Perfect number!");
else
[Link]("Not a perfect number.");
}
public static void main(String[] args){
Scanner sc = new Scanner([Link]);
[Link]("Enter the number: ");
int n =[Link]();
 Perfect obj = new Perfect(n);
[Link]();
}
}
[Link]
public class Main
{
public static void main (String[]args)
{
int num = 1634, len;
len = order (num);
if (armstrong (num, len))
[Link](num + " is armstrong");
else
[Link](num + " is armstrong");
}
static int order (int x)
{
int len = 0;
while (x != 0 )
{
len++;
x = x / 10;
}
return len;
}
static boolean armstrong (int num, int len)
{
int sum = 0, temp, digit;
temp = num;
while (temp != 0)
{
digit = temp % 10;
sum = sum + (int)[Link](digit, len);
temp /= 10;
};
return num == sum;
}
}