package numberprogram;

import java.util.Scanner;
public class ArmstrongNo {

public static void main(String[] args) {

Scanner s = new Scanner(System.in);

System.out.println("Enter a number which want to check for Armstrong
number : ");
int num = s.nextInt();
int temp = num;

int res = armstrong(temp,num);

if(res==num)
{
System.out.println("it is a armstrong number ");
}
else
{
System.out.println("it is not armstrong number ");
}
}

public static int armstrong(int a,int b)

{
int count = 0;

while(a!=0)
{
count++;
a = a/10;
}

int sum =0;

while(b!=0)
{
int res = b%10;
int pow = 1;
for(int i=0;i<count;i++)
{
pow = pow * res;
}

sum = sum + pow;

b = b/10;
}

return sum;
}
}

=======================================================================
package numberprogram;

import java.util.Scanner;
public class AutomorphicNo {

public static void main(String[] args) {

Scanner s = new Scanner(System.in);

System.out.println("Enter a number : ");
int num = s.nextInt();

int ans = automorphic(num);

System.out.println(ans);

if(num==ans)
{
System.out.println("It is a automorphic number");
}
else
{
System.out.println("It is not a automorphic number ");
}
}

public static int automorphic(int a)

{
int temp = a;

int ct = 0;
while(temp!=0)
{
ct++;
temp/=10;
}

int sq = a * a ;

int pow =1;

for(int i=0;i<ct;i++)
{
pow = pow *10;
}

int res = sq % pow;

return res;

}
}

=================================================================================

package numberprogram;
import java.util.Scanner;
public class BuzzNo {

public static void main(String[] args) {

Scanner s = new Scanner(System.in);
System.out.println("Enter a number ");
int num = s.nextInt();

boolean ans = buzz(num);

if(ans)
{
System.out.println("its a buzz number");
}
else
{
System.out.println("its not a buzz number");
}
}

public static boolean buzz(int a)

{
boolean dec = false;
if((a%10==7) || (a%7==0))
{
dec = true;
}
return dec;
}
}
================================================================================

package numberprogram;

import java.util.Scanner;
public class CircularPrimeNo {

public static void main(String[] args) {

Scanner rto = new Scanner(System.in);

System.out.println("Enter a number ");
int num = rto.nextInt();
int temp = num;

int count =0;

while(temp!=0)
{
count++;
temp = temp/10;
}

temp = num ;

boolean pn = true;
int i;
for(i=2; i<num; i++)
 {
if(i%num==0)
{
pn = false;
break;
}
}

if(pn)
{
System.out.println("It is not a prime a number ");
}
else
{

int pow =1;

for(int j=0;j<count; j++)
{
pow = pow * 10;
}

System.out.println(pow);

}
}

==========================================================================

package numberprogram;

import java.util.Scanner;
public class DisariumNo {

public static void main(String[] args)

{
Scanner key = new Scanner(System.in);
System.out.println("Enter a number");
int num = key.nextInt();

int temp = num;

int count=0;
while(temp!=0)
{
count ++;
temp/= 10;
}

temp = num;

int sum = 0;
while(temp!=0)
{
 int rem = temp % 10 ;

int pow = 1;
for(int i=0; i<count; i++)
{
pow = pow * rem;
}

sum = sum + pow ;

count--;

temp/= 10;
}

if(num==sum)
{
System.out.println("it is a Disarium number");
}
else
{
System.out.println("it is not a Diasarium number");
}
}
}

=====================================================================

package numberprogram;

import java.util.Scanner;
public class DuckNo {

public static void main(String[] args) {

Scanner s = new Scanner(System.in);

System.out.println("Enter a Number ");
int num = s.nextInt();

boolean ans = checkDuck(num);

if(ans)
{
System.out.println("it is a duck number");
}
else
{
System.out.println("it is not a duck number");
}
}

public static boolean checkDuck(int a)

{
boolean pre = false;
while(a!=0)
{
int res = a%10;
 if(res==0)
{
pre = true;
break;
}

a/=10;
}

return pre;
}
}

==========================================================================

package numberprogram;

import java.util.Scanner;
public class Factorial {

public static void main(String[] args) {

Scanner sp = new Scanner(System.in);

System.out.println("Enter a Number ");
int no = sp.nextInt();

int ans = factorial(no);

System.out.println("Given number's Factorial is " + ans);
}

public static int factorial(int num)

{
int pow = 1;

for(int i=1;i<=num;i++)
{
pow = pow * i;
}

return pow;
}
}

======================================================================

package numberprogram;

import java.util.Scanner;
public class FibonaciiSeries {

public static void main(String[] args) {

Scanner lc = new Scanner(System.in);

System.out.println("Enter a number ");
 int num = lc.nextInt();

int n1=0, n2=1, n3=0;

while(n3<num)
{
n3 = n1 + n2 ;

n1 = n2;
n2 = n3;
}
if(n3==num)
{
System.out.println(num+" is present in fiboncii series" );
}
else
{
System.out.println("this "+ num + " is not present in fibonacii
series");
}

}
}

==============================================================================

package numberprogram;

import java.util.Scanner;
public class FloydNo {

public static void main(String[] args) {

Scanner sh = new Scanner(System.in);

System.out.println("Enter a number : ");
int num = sh.nextInt();

int k=0;
for(int i=1;i<num;i++)
{
for(int j=0;j<i;j++)
{
System.out.print(k+" ");
}
System.out.println();
k++;
}

}
}

============================================================================

package numberprogram;
import java.util.Scanner;
public class HarshasdNo {

public static void main(String[] args) {

Scanner io = new Scanner(System.in);

System.out.println("Enter a number ");
int num = io.nextInt();
int temp = num ;

int sum =0;

while(temp!=0)
{
int res = temp %10 ;

sum = sum + res;

temp/=10;
}

if(num%sum==0)
{
System.out.println("it is a harshad number");
}
else
{
System.out.println("it is not a navin number");
}
}
}

==========================================================================

package numberprogram;

import java.util.Scanner;
public class HCF {

public static void main(String[] args) {

Scanner jk = new Scanner(System.in);

System.out.println("Enter a first number ");
int num1 = jk.nextInt();

System.out.println("Enter a second number ");

int num2 = jk.nextInt();

int least = num1 < num2 ? num1 : num2;

while(true)
{
if(num1%least==0 && num2%least==0)
{
System.out.println(least);
break;
}
 least--;
}
}
}

======================================================================

package numberprogram;

import java.util.Scanner;
public class LCM {

public static void main(String[] args) {

Scanner sp = new Scanner(System.in);

System.out.println("Enter a first number ");
int num1 = sp.nextInt();

System.out.println("Enter a second number ");

int num2 = sp.nextInt();

int large = num1 > num2 ? num1 : num2;

while(true)
{
if(large%num1==0 && large%num2==0)
{
System.out.println(large);
break;
}
large++;
}
}
}

=====================================================================

package numberprogram;

import java.util.Scanner;
public class MagicNo {

public static void main(String[] args) {

Scanner jv = new Scanner(System.in);

System.out.println("Enter a number");
int num = jv.nextInt();

while(num>9)
{
int sum =0;
while(num>0)
{
int rem = num %10;
 sum = sum + rem;
num/=10;
}
num = sum;
sum = 0;
}

if(num==1)
{
System.out.println("It is a magic number");
}
else
{
System.out.println("It is not a magic number");
}
}
}

===========================================================================

package numberprogram;

import java.util.Scanner;
public class MultiplyaNo {

public static void main(String[] args) {

Scanner io = new Scanner(System.in);

System.out.println("Enter a number");
int num = io.nextInt();
int pow=1;

while(num>0)
{
int rem = num%10;
if(rem!=0)
{
pow = pow * rem;
}
num/=10;
}

System.out.println(pow);
}
}

===========================================================================

package numberprogram;

import java.util.Scanner;
public class NeonNo {

public static void main(String[] args) {

 Scanner sp = new Scanner(System.in);
System.out.println("Enter a number : ");
int num = sp.nextInt();

int sq = num * num ;

int sum = 0;
while(sq>0)
{
int rem = sq%10;

sum = sum + rem;

sq/=10;
}

if(sum==num)
{
System.out.println("it is a neon number ");
}
else
{
System.out.println("it is not a neon number ");
}
}
}

============================================================================

package numberprogram;

import java.util.Scanner;
public class Palindrome {

public static void main(String[] args) {

Scanner sp = new Scanner(System.in);

System.out.println("Enter a number ");
int num = sp.nextInt();

int temp = num;

int sum = 0;
while(temp!=0)
{
int rem = temp % 10 ;
sum = (sum*10) + rem;
temp/=10;
}

if(num==sum)
{
System.out.println("it is a palindrome");
 }
else
{
System.out.println("it is not a palindrome ");
}
}
}

=============================================================================

package numberprogram;

import java.util.Scanner;
public class PerfectNo {

public static void main(String[] args) {

Scanner kl = new Scanner(System.in);

System.out.println("Enter a number ");
int num = kl.nextInt();

int sum=0;
for(int i=1; i<num; i++)
{
if(num%i==0)
{
sum = sum + i;
}
}

if(sum==num)
{
System.out.println("it is a perfect number");
}
else
{
System.out.println("it is not perfect number");
}
}
}

=======================================================================

package numberprogram;

import java.util.Scanner;
public class Primeno {

public static void main(String[] args) {

Scanner rt = new Scanner(System.in);

System.out.println("Enter a number");
int num = rt.nextInt();
 int den;
for(den=2; den<=num; den++)
{
if(num%den==0)
{
break;
}
}

if(den==num)
{
System.out.println("it is a prime number");
}
else
{
System.out.println("it is not a prime number");
}
}
}

=======================================================================

package numberprogram;

import java.util.Scanner;
public class PronicNo {

public static void main(String[] args) {

Scanner key = new Scanner(System.in);

System.out.println("Enter a number ");
int ans = key.nextInt();

boolean flag = false;

for(int i=1; i<ans; i++)
{
if(ans == i*(i+1))
{
flag = true;
break;
}
}

if(flag)
{
System.out.println("it is a pronic number");
}
else
{
System.out.println("it is not a pronic number ");
}
}
}

========================================================================
package numberprogram;

import java.util.Scanner;
public class ReverseNo {

public static void main(String[] args) {

Scanner pg = new Scanner(System.in);

System.out.println("Enter a number ");
int num = pg.nextInt();
int sum=0;

while(num>0)
{
int rem = num% 10;

sum = (sum*10) + rem;

num/=10;
}
System.out.println(sum);
}
}

======================================================================

package numberprogram;

import java.util.Scanner;
public class RotateNo {

public static void main(String[] args) {

Scanner mh = new Scanner(System.in);

System.out.println("Enter a number");
int num = mh.nextInt();
int temp = num;

int count = 0;

while(temp>0)
{
count++;
temp/=10;
}

int pow = 1;
for(int i=0; i<count-1; i++)
{
pow = pow * 10;
}

System.out.println("Enter a no. of rotation ");

int rot = mh.nextInt();
 int rotate = 0;
for(int i=0; i<rot; i++)
{
int rem = num % 10;
num/=10;
rotate = (rem*pow) + num;

System.out.println(rotate);
num = rotate;
}
}
}

==========================================================================

package numberprogram;

import java.util.Scanner;
public class SpecialNo {

public static void main(String[] args) {

Scanner gj = new Scanner(System.in);

System.out.println("Enter a number");
int num = gj.nextInt();
int temp = num;

int sum = 0;
while(num!=0)
{
int res = num%10;

int pow=1;
for(int i=1;i<=res;i++)
{
pow = pow * i;
}

sum = sum + pow;

num/=10;
}

if(sum==temp)
{
System.out.println("it is a special number");
}
else
{
System.out.println("it is not a special number");
}
}
}

===========================================================================
package numberprogram;

import java.util.Scanner;
public class SpyNo {

public static void main(String[] args) {

Scanner st = new Scanner(System.in);

System.out.println("Enter a number");
int num = st.nextInt();
int temp = num;

int sum=0;
int pow = 1;
while(temp!=0)
{
int rem = temp % 10;

sum = sum + rem;

pow = pow * rem;
temp/=10;
}

if(pow==sum)
{
System.out.println("it is a Spy number");
}
else
{
System.out.println("it is not a Spy number");
}
}
}

===========================================================================

package numberprogram;

import java.util.Scanner;
public class TechNo {

public static void main(String[] args) {

Scanner key = new Scanner(System.in);

System.out.println("Enter a number");
int num = key.nextInt();
int temp = num;

int count=0;
while(temp!=0)
{
count++;
temp/= 10;
}

temp = num;
if(count%2==0)
 {
int sp = count/2;
int pow = 1;
for(int i=0; i<sp; i++)
{
pow = pow *10;
}

int rem = temp / pow ;

int res = temp % pow ;

int ans = rem + res;

int sq = ans * ans;

if(sq==num)
{
System.out.println("it is a Tech number");
}
else
{
System.out.println("it is not a Tech number");
}

}
else
{
System.out.println("It is not a Tech number");
}
}
}

========================================================================

package numberprogram;

import java.util.Scanner;
public class UglyNo {

public static void main(String[] args) {

Scanner sp = new Scanner(System.in);

System.out.println("Enter a number");
int num = sp.nextInt();

int i;
for(i=2;i<=num;i++)
{
if(num%i==0)
{
num/=i;
i--;
}
}

if(i<=5)
{
System.out.println("it is a ugly number");
}
 else
{
System.out.println("it is not a ugly number");
}
}
}

===========================================================================

package numberprogram;

import java.util.Scanner;
public class UniqueNo {

public static void main(String[] args) {

Scanner op = new Scanner(System.in);

System.out.println("Enter a number");
int num = op.nextInt();

int n1 = num;
int n2 = num;
int count =0;

while(n1>0)
{
int rem = n1%10;

while(n2>0)
{
int res = n2 % 10;

if(res==rem)
{
count++;
}
n2/=10;
}
n1/=10;
}

if(count==1)
{
System.out.println("it is a unique number");
}
else
{
System.out.println("it is not a unique number");
}
}
}