Smith Number Checker

digitSum(n) = digitSum(factors)

CalculatorsFreeNo Signup
4.5(174 reviews)
All Tools

Loading tool...

About Smith Number Checker

A Smith number checker testing if the digit sum of n equals the digit sum of its prime factorization (with repetition). Example: 22 = 2×11, digitSum(22)=4, digitSum(2)+digitSum(11)=2+2=4. All calculations are client-side.

Smith Number Checker Features

  • Smith check
  • Factor digits
  • Range scan
  • Table
  • Smith brothers
Smith number: composite n where digitSum(n) = sum of digit sums of prime factors (with multiplicity). Named after Harold Smith, whose phone number 493-7775 = 3×5²×65837 satisfies this. First few: 4,22,27,58,85,94.

How to Use

Enter n:

  • Check: Is n a Smith number?
  • Digit sum: Of n and its factors
  • Factors: Prime factorization

Properties

  • There are infinitely many Smith numbers
  • Smith brothers: consecutive Smith numbers
  • k-Smith: digit sum equals k× factor digit sum

History

Albert Wilansky noticed his brother-in-law Harold Smith's phone number 4937775 had this property. The name 'Smith number' stuck after Wilansky published it in 1982.

Step-by-Step Instructions

  1. 1Enter n.
  2. 2Check Smith.
  3. 3View factorization.
  4. 4Compare digit sums.
  5. 5Scan range.

Smith Number Checker — Frequently Asked Questions

Are there infinitely many Smith numbers?+

Yes! Wayne McDaniel proved in 1987 that there are infinitely many Smith numbers. The proof constructs them from repunit primes (primes consisting of all 1s). Smith numbers have a positive density among composite numbers.

What are Smith brothers?+

Consecutive Smith numbers, like (728,729) or (2964,2965). It's conjectured there are infinitely many Smith brothers, but this is unproved. The concept is analogous to twin primes for Smith numbers.

Can primes be Smith numbers?+

No, by definition Smith numbers must be composite. A prime p has digitSum(p) = digitSum(p) trivially, so the property would be meaningless. The requirement is specifically for composite numbers.

Share this tool: