---
title: "Smith numbers in java"  
description: "In this blog I am provide you the code Smith numbers in java.import java.util.Scanner;  import java.io.*;   public class smith        public void fin"  
author: "Vijay Shukla"  
published: 2013-10-04  
updated: 2014-09-18  
canonical: https://www.mindstick.com/blog/596/smith-numbers-in-java  
category: "java"  
tags: ["java"]  
reading_time: 3 minutes  

---

# Smith numbers in java

In this [blog](https://www.mindstick.com/articles/12705/myths-and-misconception-about-blog) I am provide you the [code](https://yourviews.mindstick.com/view/85458/alan-turing-the-mastermind-behind-cracking-the-enigma-code-during-world-war-ii) Smith numbers in java.

```
import java.util.Scanner;import java.io.*;
public class smith{    public void findNumber()    {        int num,n,x,y,sumdigits=0,sumfactors=0;        boolean flag;        Scanner scan=new Scanner(System.in);        System.out.print("Enter the number:");        n=scan.nextInt();
        num=n;        sumdigits=sumOfDigits(n);
        for(x=2;x<=n;x++)        {            if(n%x==0)            {                flag=isPrime(x);                if(flag)                {                    y=x;                    while(y>0)                    {                        sumfactors=sumfactors+y%10;                        y=y/10;                    }                    n=n/x;                    x--;                }
            }        }
        if(sumdigits==sumfactors)            System.out.println("\n"+num+ " is a smith number.");        else
            System.out.println("\n"+num+ " is not a smith number.");
    }    //to print digits of n and return their sum    public int sumOfDigits(int n)    {        int rem, s=0;        while(n>0)        {            rem=n%10;            /*System.out.print(rem+" ");*/            s=s+rem;            n=n/10;        }        return s;    }    //to check i isprime or not    public boolean isPrime(int n)    {
        int x;        boolean flag=true;
        for(x=2;x< n;x++)        {
            if(n%x==0)            {                flag=false;                break;            }//if ends
        }//for ends        return flag;    }//isPrime ends    //to call other methods
    public static void main(String args[])
    {        smith obj=new smith();        obj.findNumber();    }//main() ends
}//class ends
```

\

##### Output: -

![Smith numbers in java](https://www.mindstick.com/blogs/85472185-7b65-46f4-80b1-2f86cc531e43/images/a3349cda-0b5e-4aa1-bcc2-2e6e5de57d36.png)

---

Original Source: https://www.mindstick.com/blog/596/smith-numbers-in-java

Copyright © MindStick Software Pvt. Ltd. This Markdown version is provided for developers, AI systems, and offline reading.