Loading AI tools
Type of composite integer From Wikipedia, the free encyclopedia
In number theory, a Smith number is a composite number for which, in a given number base, the sum of its digits is equal to the sum of the digits in its prime factorization in the same base. In the case of numbers that are not square-free, 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:
while
Let be a natural number. For base , let the function be the digit sum of in base . A natural number with prime factorisation is a Smith number if Here the exponent is the multiplicity of as a prime factor of (also known as the p-adic valuation of ).
For example, in base 10, 378 = 21 · 33 · 71 is a Smith number since 3 + 7 + 8 = 2 · 1 + 3 · 3 + 7 · 1, and 22 = 21 · 111 is a Smith number, because 2 + 2 = 2 · 1 + (1 + 1) · 1.
The first few Smith numbers in base 10 are
W.L. McDaniel in 1987 proved that there are infinitely many Smith numbers.[1][2] The number of Smith numbers in base 10 below 10n for n = 1, 2, ... is given by
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]
Smith numbers can be constructed from factored repunits.[5][verification needed] As of 2010[update], the largest known Smith number in base 10 is
where R1031 is the base 10 repunit (101031 − 1)/9.[citation needed][needs update]
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.