Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package OOP;
- import java.util.Scanner;
- class Number{
- int num;
- public int getNum() {
- return num;
- }
- public void setNum(int num) {
- this.num = num;
- }
- public Number(int num) {
- this.num = num;
- }
- int isOdd(){
- return (num%2);
- }
- int isEven(){
- return (num%2 == 0)? 1:0;
- }
- boolean isPrime(int num){
- int i = 2;
- while((num = num/10) > 0)
- if(num%i++ == 0)
- return false;
- return true;
- }
- boolean isPerfect(int num){
- int sum=0;
- for(int i=1; i<num; i++)
- if(num%i == 0)
- sum +=i;
- if(num == sum)
- return true;
- return false;
- }
- int countDigit(int num){
- int i=0;
- while(num>0){
- num = num/10;
- i++;
- }
- return i;
- }
- int reverseNumber(int num){
- int n = countDigit(num), sum = 0;
- for(int i=0;i< n; i++, num /=10)
- sum =sum*10 + num%10;
- return sum;
- }
- boolean isPalindrome(int num){
- int rev = reverseNumber(num);
- return (num == rev);
- }
- }
- public class LabTest2 {
- public static void main(String args[]){
- Scanner scn = new Scanner(System.in);
- int num = scn.nextInt();
- Number obj = new Number(num);
- System.out.println("Even = "+obj.isEven()+" Odd = "+obj.isOdd());
- System.out.println("Palindrome = "+obj.isPalindrome(num));
- System.out.println("Reverse Number = "+obj.reverseNumber(num));
- System.out.println("Prime = "+obj.isPrime(num));
- System.out.println("Total Number of Digit is "+obj.countDigit(num));
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement