Skip to content

SmithNumbers ​

The Smith numbers 4,22,27,58,85,…4, 22, 27, 58, 85, …: composite integers whose digit sum equals the digit sum of their prime factors (with multiplicity).

SmithNumbersthe composite nn with digitSum(n)=∑digitSum(p)\mathrm{digitSum}(n) = \sum \mathrm{digitSum}(p) over nn's prime factorisation, an infinite indexed collection.

Domain: Collections

Details
  • A lazy indexed collection: Count(SmithNumbers)=+∞Count(SmithNumbers) = +\infty (McDaniel, 1987). OEIS A006753.
  • At(SmithNumbers,k)At(SmithNumbers, k) unranks by scanning forward, factoring each candidate -- At(SmithNumbers,2)=22At(SmithNumbers, 2) = 22 (2+2=42+2=4; factors 2,112, 11, digit sums 2+1+1=42+1+1=4).
  • Membership goes through Element: Element(4,SmithNumbers)Element(4, SmithNumbers) is true (4=2×24=2 \times 2: digit sums 4=2+24 = 2+2), Element(6,SmithNumbers)Element(6, SmithNumbers) is false (6=2×36=2\times3: digit sums 2+3=5≠62+3=5 \ne 6).

Enumeration

Examples

1 more kept as data, checked against the oracles
Properties #
live ↗
In4∈SmithNumbers4∈\mathrm{SmithNumbers}OutTrue\mathrm{True}
live ↗
In6∈SmithNumbers6∈\mathrm{SmithNumbers}OutFalse\mathrm{False}
About
Examples3
CrosswalkOEIS

See also: Count, At, Element, HarshadNumbers, SemiprimeNumbers