## You are here

HomeSmarandache-Wellin number

## Primary tabs

# Smarandache-Wellin number

Given a base $b$, concatenate the base $b$ representations of the first $n$ primes into a single integer, placing the first prime as the most significant digit(s) and the $n$th prime as the least significant digit(s). This is the Smarandache-Wellin number $S_{n}$.

For example, in base 10, $S_{8}$ is 235711131719, the concatenation of the strings “2”, “3”, “5”, “7”, “11”, “13”, “17” and “19” reinterpreted as a single integer.

Placing a decimal point immediately preceding a base 10 Smarandache-Wellin number turns it into an approximation of the Copeland-Erdos constant.

R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective, Springer, NY, 2001: 72

H. Ibstedt, A Few Smarandache Sequences, Smarandache Notions Journal, Vol. 8, No. 1-2-3, 1997: 170 - 183

## Mathematics Subject Classification

11A63*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

new question: Prove a formula is part of the Gentzen System by LadyAnne

Mar 30

new question: A problem about Euler's totient function by mbhatia

new problem: Problem: Show that phi(a^n-1), (where phi is the Euler totient function), is divisible by n for any natural number n and any natural number a >1. by mbhatia

new problem: MSC browser just displays "No articles found. Up to ." by jaimeglz

Mar 26

new correction: Misspelled name by DavidSteinsaltz

Mar 21

new correction: underline-typo by Filipe

Mar 19

new correction: cocycle pro cocyle by pahio

Mar 7

new image: plot W(t) = P(waiting time <= t) (2nd attempt) by robert_dodier

new image: expected waiting time by robert_dodier

new image: plot W(t) = P(waiting time <= t) by robert_dodier