Smith Number Checker

digitSum(n) = digitSum(factors)

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
Advertisement
Advertisement