package

package numberChecker;

public class number{
    public boolean checkPalindrome(int num) {
        int r,rev=0,temp=num;
        while (temp>0) {
            r= temp%10;
            rev= (rev*10)+r;
            temp= temp/10;
        }
        return (num == rev);
    }

    public boolean checkArmstrong(int num){
        int r, sum=0, temp=num;
        while (temp > 0) {
            r = temp%10;
            sum += (r * r * r);
            temp = temp / 10;
        }
        return (num == sum);
    }

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

    public boolean checkPrime(int num){
        if (num < 2){
            return false;
        }
        for (int i=2; i<(num/2)+1; i++){
            if (num % i ==0 ){
                return false;
            }
        }
        return true;
    }
}