Strong number in java

Strong number program in java. Number is strong if sum of factorial of individual digits of number equals to the number. Example Number 145 is strong because sum of factorial of 1, 4 and 5 is 145 i.e 1(1!)+24(4!)+120(5!)=145 where ! represents factorial symbol

import java.util.Scanner;

public class Programming
{
	static int  fact(int Number)
	{
		if (Number==1)
			return 1;
		else
		{
			return(Number*fact(Number-1));
		}
	}
	
   public static void main(String[] args)
   {	 
	   int Number,sum=0,Remainder,OriginalNumber;
	   Scanner input=new Scanner(System.in);
	   System.out.print("enter Number:");
	   Number=input.nextInt();
	   input.close();
	   OriginalNumber=Number;
	   while(Number !=0)
	   {
		   Remainder=Number%10;
		   sum=sum+fact(Remainder);
		   Number=Number/10;
	   }
	   if(OriginalNumber==sum)
	   {
	   System.out.println("Number "+OriginalNumber+" is Strong Number");
	   }
	   else
	   {
		   System.out.println("Number is NOT Strong Number");
	   }
   }
   
}
OUTPUT:
enter value:145
Number 145 is Strong Number
---------------------------
enter value:155
Number is NOT Strong Number