Multiply the first seven primes and the workbench prints 5.1051⋅10+5 — 510,510. Add one and the same display gains a digit: 5.10511⋅10+5. The second link is a factorization rather than a product of primes, 19 × 26869, and it prints the same line as the first, which is how you can see on the screen that 510,511 is not prime. Split the larger factor and it is 97 × 277, so the number is 19 × 97 × 277.
None of 19, 97 or 277 is in the original list, and that is the entire content of Euclid's argument. Suppose a prime p divided both 510,510 and 510,511: then p divides their difference, which is 1, and nothing does. So every prime factor of the plus-one number must be a new one — three of them here, not one. The version often taught, that the construction always yields a prime, is false, and it fails one prime earlier than this: the primes 2, 3, 5, 7, 11, 13 give 30,031 = 59 × 509 by the same recipe.
Answer
5.10511⋅10+5
How to read it
2·3·5·7·11·13·17 + 1 on the workbench. The second link is the same value written as its factors; the third is the product alone, 510 510.
Source
Euclid, Elements IX.20 takes the least number measured by the assigned primes, adds a unit, and argues that a prime measuring it is not among those assigned; for 2, 3, 5, 7, 11, 13, 17 that number is 510 511 = 19 × 97 × 277, so the product-plus-one is composite. The stronger claim that it must be prime is a modern misreading, and the sequence of least new prime factors is the Euclid–Mullin sequence
Work it in the calculator
These links open the right calculator with this problem's numbers already typed in. The line above is what the screen should show — check it yourself.