Palindrome number

src/Algorithms/Math/PalindromeNumber.java

@@ -0,0 +1,16 @@
+package Algorithms.Math;
+
+public class PalindromeNumber {
+
+	public static boolean get(int x)
+	{
+		if (x<0 || (x!=0 && x%10==0)) return false;
+	    int rev = 0;
+	    while (x>rev){
+
+	    	rev = rev*10 + x%10;
+	    	x = x/10;
+	    }
+	    return (x==rev || x==rev/10);
+	}
+}

src/Algorithms/Math/PerfectNumber.java

@@ -21,10 +21,7 @@ public static  boolean get(int num)
 
 		for(int i=2;i<=Math.sqrt(num);i++)
 		{
-			if(num%i==0)
-			{
-				sum+=i;
-			}
+			if(num%i==0){sum+=i;}
 			if(i!=num/i) sum+=num/i;
 		}
 		sum++;

src/HomeMath.java

@@ -31,11 +31,16 @@ public static void main(String args[]){
 						Divisors of 6 are 1, 2 and 3. Sum of 
 						divisors is 6.
 				 */
-
+				/*
 				boolean isPerfect =Algorithms.Math.PerfectNumber.get(8);
 				System.out.println(isPerfect);
-
-
-
+				*/
+		       /**
+		        * Input 12321 is a palindrome number
+		        * Input 1231 is not a palindrome number
+		        */
+				boolean isPalindrome =Algorithms.Math.PalindromeNumber.get(12321);
+				System.out.println(isPalindrome);
+
  }
 }