Armstrong Number

An Armstrong number is the one that equals the sum of its digits raised to the power of the number of digits in that number which is to be checked. To be more clear, let the number be n and the number of digits be x. We represent the number as n_xn_x-1n_x-2...n₃n₂n₁ where n₁, n₂, n₃...n_x are single digits 0-9. n is an Armstrong number if

n₁^x + n₂^x + n₃^x + n_x-1^x + n_x^x = n

153, 371, 9474 and 54748 are few Armstrong numbers.

153 = 1³ + 5³ + 3³
371 = 3³ +7³ +1³
9474 = 9⁴ + 4⁴ +7⁴ + 4⁴
54748 = 5⁵ + 4⁵ + 7⁵ + 4⁵ + 8⁵

   class Armstrong
   {
     public static void main(String args[])
     {
       int num = Integer.parseInt(args[0]);
       int n = num; //use to check at last time
       int check=0,remainder;
       while(num > 0)
       {
         remainder = num % 10;
         check = check + (int)Math.pow(remainder,3);
         num = num / 10;
       }
       if(check == n)
         System.out.println(n+" is an Armstrong Number");
       else
         System.out.println(n+" is not a Armstrong Number");
     }
   }