Smith Number

import java.util.*;
class SmithNumber
{
    // Smith number is a Composite Number whose sum of digits is equal
    // to the sum of digits of its prime factors
    // e.g. 666
    public static void main()
    {
        Scanner in=new Scanner(System.in);
        System.out.println("Enter a number");
        int n=in.nextInt();
        int s=0,sd=sum(n);
        if(isPrime(n))
            System.out.println("The Number is Prime");
        else
        {
            int k=2;            
            while(n>1)
            {
                if(isPrime(k) && n%k==0)
                {
                    n=n/k;
                    s=s+sum(k);                    
                }
                else
                    k++;
            }
            if(s==sd)
                System.out.println("Smith Number");
            else
                System.out.println("Not a Smith Number");
        }
    }
    public static boolean isPrime(int n)
    {
        for(int i=2;i<n;i++)
        if(n%i==0)
        return false;
        return true;
    }    
    public static int sum(int n)
    {
        int s=0,i;
        for(i=n;i>0;i/=10)
            s=s+(i%10);            
        return s;
    }
}