Misplaced Pages

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:

4937775 = 3 · 5 · 5 · 65837

while

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

in base 10.

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 factorization $${\displaystyle n=\prod _{\stackrel {p\mid n,}{p{\text{ prime}}}}p^{v_{p}(n)}}$$ is a Smith number if $${\displaystyle F_{b}(n)=\sum _{\stackrel {p\mid n,}{p{\text{ prime}}}}v_{p}(n)F_{b}(p).}$$ 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

4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526, 535, 562, 576, 588, 627, 634, 636, 645, 648, 654, 663, 666, 690, 706, 728, 729, 762, 778, 825, 852, 861, 895, 913, 915, 922, 958, 985. (sequence A006753 in the OEIS)

Properties

W.L. McDaniel in 1987 proved that there are infinitely many Smith numbers. The number of Smith numbers in base 10 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. 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, 728, 73615, 4463535, 15966114, 2050918644, 164736913905, ... (sequence A059754 in the OEIS).

Smith numbers can be constructed from factored repunits. As of 2010, the largest known Smith number in base 10 is

9 × R₁₀₃₁ × (10 + 3×10 + 1) ×10

where R₁₀₃₁ is the base 10 repunit (10 − 1)/9.

See also

• Equidigital number

Notes

1. ^ Sándor & Crstici (2004) p.383
2. McDaniel, Wayne (1987). "The existence of infinitely many k-Smith numbers". Fibonacci Quarterly. 25 (1): 76–80. doi:10.1080/00150517.1987.12429731. Zbl 0608.10012.
3. Sándor & Crstici (2004) p.384
4. Shyam Sunder Gupta. "Fascinating Smith Numbers".
5. Hoffman (1998), pp. 205–6

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. ISBN 1-4020-2546-7. 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.

v t e Divisibility-based sets of integers
Overview	Integer factorization Divisor Unitary divisor Divisor function Prime factor Fundamental theorem of arithmetic
Factorization forms	Prime Composite Semiprime Pronic Sphenic Square-free Powerful Perfect power Achilles Smooth Regular Rough Unusual
Constrained divisor sums	Perfect Almost perfect Quasiperfect Multiply perfect Hemiperfect Hyperperfect Superperfect Unitary perfect Semiperfect Practical Descartes Erdős–Nicolas
With many divisors	Abundant Primitive abundant Highly abundant Superabundant Colossally abundant Highly composite Superior highly composite Weird
Aliquot sequence-related	Untouchable Amicable (Triple) Sociable Betrothed
Base-dependent	Equidigital Extravagant Frugal Harshad Polydivisible Smith
Other sets	Arithmetic Deficient Friendly Solitary Sublime Harmonic divisor Refactorable Superperfect

• Base-dependent integer sequences
• Eponymous numbers in mathematics
• Lehigh University