|
| 1 | +import java.lang.Math; |
| 2 | +import java.util.Scanner; |
| 3 | +class Number |
| 4 | +{ |
| 5 | + private int num; |
| 6 | + Number(int num) |
| 7 | + { |
| 8 | + this.num = num; |
| 9 | + } |
| 10 | + public boolean isZero() |
| 11 | + { |
| 12 | + if(num==0) |
| 13 | + return true; |
| 14 | + else |
| 15 | + return false; |
| 16 | + } |
| 17 | + public boolean isPositive() |
| 18 | + { |
| 19 | + if(num>0) |
| 20 | + return true; |
| 21 | + else |
| 22 | + return false; |
| 23 | + } |
| 24 | + public boolean isNegative() |
| 25 | + { |
| 26 | + if(num<0) |
| 27 | + return true; |
| 28 | + else |
| 29 | + return false; |
| 30 | + } |
| 31 | + public boolean isOdd() |
| 32 | + { |
| 33 | + if(num%2!=0) |
| 34 | + return true; |
| 35 | + else |
| 36 | + return false; |
| 37 | + } |
| 38 | + public boolean isEven() |
| 39 | + { |
| 40 | + if(num%2==0) |
| 41 | + return true; |
| 42 | + else |
| 43 | + return false; |
| 44 | + } |
| 45 | + public boolean isPrime() |
| 46 | + { |
| 47 | + int t=0; |
| 48 | + for(int i=2;i<num;i++) |
| 49 | + { |
| 50 | + if(num%i==0) |
| 51 | + { |
| 52 | + t=1; |
| 53 | + break; |
| 54 | + } |
| 55 | + } |
| 56 | + if(t==0) |
| 57 | + return true; |
| 58 | + else |
| 59 | + return false; |
| 60 | + } |
| 61 | + public boolean isArmstrong() |
| 62 | + { |
| 63 | + int t, rem, sum=0, count=0; |
| 64 | + t=num; |
| 65 | + while(t!=0) |
| 66 | + { |
| 67 | + count+=1; |
| 68 | + t/=10; |
| 69 | + } |
| 70 | + t=num; |
| 71 | + while(t!=0) |
| 72 | + { |
| 73 | + rem = t%10; |
| 74 | + sum = sum + (int)Math.pow(rem,count); |
| 75 | + t/=10; |
| 76 | + |
| 77 | + } |
| 78 | + if(sum==num) |
| 79 | + return true; |
| 80 | + else |
| 81 | + return false; |
| 82 | + } |
| 83 | + public int getFactorial() |
| 84 | + { |
| 85 | + int f=1; |
| 86 | + for(int i=1;i<=num;i++) |
| 87 | + { |
| 88 | + f*=i; |
| 89 | + } |
| 90 | + return f; |
| 91 | + } |
| 92 | + public int getSqrt() |
| 93 | + { |
| 94 | + return (int)Math.sqrt(num); |
| 95 | + } |
| 96 | + public int getSqr() |
| 97 | + { |
| 98 | + return (int)Math.pow(num,2); |
| 99 | + } |
| 100 | + public int sumDigits() |
| 101 | + { |
| 102 | + int sum= 0, rem, t=num; |
| 103 | + while(t!=0) |
| 104 | + { |
| 105 | + rem = t%10; |
| 106 | + sum+=rem; |
| 107 | + t/=10; |
| 108 | + } |
| 109 | + return sum; |
| 110 | + } |
| 111 | + public String dispBinary() |
| 112 | + { |
| 113 | + return Integer.toBinaryString(num); |
| 114 | + } |
| 115 | + public String dispOctal() |
| 116 | + { |
| 117 | + return Integer.toOctalString(num); |
| 118 | + } |
| 119 | + public String dispHexa() |
| 120 | + { |
| 121 | + return Integer.toHexString(num); |
| 122 | + } |
| 123 | + public static void main(String args[]) |
| 124 | + { |
| 125 | + Scanner sc = new Scanner(System.in); |
| 126 | + int num = sc.nextInt(); |
| 127 | + Number obj = new Number(num); |
| 128 | + System.out.println(obj.isZero()); |
| 129 | + System.out.println(obj.isPositive()); |
| 130 | + System.out.println(obj.isNegative()); |
| 131 | + System.out.println(obj.isOdd()); |
| 132 | + System.out.println(obj.isEven()); |
| 133 | + System.out.println(obj.isPrime()); |
| 134 | + System.out.println(obj.isArmstrong()); |
| 135 | + System.out.println(obj.getFactorial()); |
| 136 | + System.out.println(obj.getSqrt()); |
| 137 | + System.out.println(obj.getSqr()); |
| 138 | + System.out.println(obj.sumDigits()); |
| 139 | + System.out.println(obj.dispBinary()); |
| 140 | + System.out.println(obj.dispOctal()); |
| 141 | + System.out.println(obj.dispHexa()); |
| 142 | + } |
| 143 | +} |
0 commit comments