Smith number

Smith number

Named after	Harold Smith ( 4, 22, 27, 58, 85, 94, 121
OEIS index	A006753

In

, the factorization is written without exponents, writing the repeated factor as many times as needed.

Smith numbers were named by Albert Wilansky of Lehigh University, as he noticed the property in the phone number (493-7775) of his brother-in-law Harold Smith:

4937775 = 3 · 5 · 5 · 65837

while

4 + 9 + 3 + 7 + 7 + 7 + 5 = 3 + 5 + 5 + (6 + 5 + 8 + 3 + 7)

in

Mathematical definition

Let ${\displaystyle n}$ be a natural number. For base ${\displaystyle b>1}$, let the function ${\displaystyle F_{b}(n)}$ be the digit sum of ${\displaystyle n}$ in base ${\displaystyle b}$. A natural number ${\displaystyle n}$ with prime factorisation

is a Smith number if Here the exponent ${\displaystyle v_{p}(n)}$ is the multiplicity of ${\displaystyle p}$ as a prime factor of ${\displaystyle n}$ (also known as the p-adic valuation of ${\displaystyle n}$).

For example, in base 10, 378 = 2¹ · 3³ · 7¹ is a Smith number since 3 + 7 + 8 = 2 · 1 + 3 · 3 + 7 · 1, and 22 = 2¹ · 11¹ is a Smith number, because 2 + 2 = 2 · 1 + (1 + 1) · 1.

The first few Smith numbers in base 10 are

985. (sequence A006753 in the OEIS

)

Properties

W.L. McDaniel in 1987 proved that there are infinitely many Smith numbers.^[1][2] The number of Smith numbers in

below 10ⁿ for n = 1, 2, ... is given by

1, 6, 49, 376, 3294, 29928, 278411, 2632758, 25154060, 241882509, ... (sequence A104170 in the OEIS).

Two consecutive Smith numbers (for example, 728 and 729, or 2964 and 2965) are called Smith brothers.^[3] It is not known how many Smith brothers there are. The starting elements of the smallest Smith n-tuple (meaning n consecutive Smith numbers) in base 10 for n = 1, 2, ... are^[4]

4, 728, 73615, 4463535, 15966114, 2050918644, 164736913905, ... (sequence A059754 in the OEIS).

Smith numbers can be constructed from factored repunits.^{[5][verification needed]} As of 2010^[update], the largest known Smith number in base 10 is

9 × R₁₀₃₁ × (10⁴⁵⁹⁴ + 3×10²²⁹⁷ + 1)¹⁴⁷⁶ ×10^3913210

where R₁₀₃₁ is the base 10 repunit (10¹⁰³¹ − 1)/9.^{[citation needed][needs update]}

See also

• Equidigital number

Notes

References

• Gardner, Martin (1988). Penrose Tiles to Trapdoor Ciphers. pp. 299–300.
• Hoffman, Paul (1998). The Man Who Loved Only Numbers: The Story of Paul Erdős and the Search for Mathematical Truth. New York: Hyperion.
• Sándor, Jozsef; Crstici, Borislav (2004). Handbook of number theory II. Dordrecht: Kluwer Academic. pp. 32–36.
  Zbl 1079.11001
  .

External links

• Weisstein, Eric W. "Smith Number". MathWorld.
• Copeland, Ed. "4937775 – Smith Numbers". Numberphile. Brady Haran. Archived from the original on 2021-12-21.