In my story “Kopfwurmkundalini”, I imagined the square root of 2 as an infinitely long worm or snake whose endlessly varying digit-segments contained all stories ever (and never) written:

• √2 = 1·414213562373095048801688724209698078569671875376948073…

But there’s another way to get all stories ever written from the number 2. You don’t look at the root(s) of 2, but at the powers of 2:

• 2 = 2^1 = 2

• 4 = 2^2 = 2*2

• 8 = 2^3 = 2*2*2

• 16 = 2^4 = 2*2*2*2

• 32 = 2^5 = 2*2*2*2*2

• 64 = 2^6 = 2*2*2*2*2*2

• 128 = 2^7 = 2*2*2*2*2*2*2

• 256 = 2^8 = 2*2*2*2*2*2*2*2

• 512 = 2^9 = 2*2*2*2*2*2*2*2*2

• 1024 = 2^10

• 2048 = 2^11

• 4096 = 2^12

• 8192 = 2^13

• 16384 = 2^14

• 32768 = 2^15

• 65536 = 2^16

• 131072 = 2^17

• 262144 = 2^18

• 524288 = 2^19

• 1048576 = 2^20

• 2097152 = 2^21

• 4194304 = 2^22

• 8388608 = 2^23

• 16777216 = 2^24

• 33554432 = 2^25

• 67108864 = 2^26

• 134217728 = 2^27

• 268435456 = 2^28

• 536870912 = 2^29

• 1073741824 = 2^30

[...]

The powers of 2 are like an ever-lengthening snake swimming across a pool. The snake has an endlessly mutating head and a rhythmically waving tail with a regular but ever-more complex wake. That is, the leading digits of 2^p don’t repeat but the trailing digits do. Look at the single final digit of 2^p, for example:

• 0__2__ = 2^1

• 0__4__ = 2^2

• 0__8__ = 2^3

• 1__6__ = 2^4

• 3__2__ = 2^5

• 6__4__ = 2^6

• 12__8__ = 2^7

• 25__6__ = 2^8

• 51__2__ = 2^9

• 102__4__ = 2^10

• 204__8__ = 2^11

• 409__6__ = 2^12

• 819__2__ = 2^13

• 1638__4__ = 2^14

• 3276__8__ = 2^15

• 6553__6__ = 2^16

• 13107__2__ = 2^17

• 26214__4__ = 2^18

• 52428__8__ = 2^19

• 104857__6__ = 2^20

• 209715__2__ = 2^21

• 419430__4__ = 2^22

[...]

The final digit of 2^p falls into a loop: 2 → 4 → 8 → 6 → 2 → 4→ 8…

Now try the final two digits of 2^p:

• __02__ = 2^1

• __04__ = 2^2

• __08__ = 2^3

• __16__ = 2^4

• __32__ = 2^5

• __64__ = 2^6

• 1__28__ = 2^7

• 2__56__ = 2^8

• 5__12__ = 2^9

• 10__24__ = 2^10

• 20__48__ = 2^11

• 40__96__ = 2^12

• 81__92__ = 2^13

• 163__84__ = 2^14

• 327__68__ = 2^15

• 655__36__ = 2^16

• 1310__72__ = 2^17

• 2621__44__ = 2^18

• 5242__88__ = 2^19

• 10485__76__ = 2^20

• 20971__52__ = 2^21

• 41943__04__ = 2^22

• 83886__08__ = 2^23

• 167772__16__ = 2^24

• 335544__32__ = 2^25

• 671088__64__ = 2^26

• 1342177__28__ = 2^27

• 2684354__56__ = 2^28

• 5368709__12__ = 2^29

• 10737418__24__ = 2^30

[...]

Now there’s a longer loop: 02 → 04 → 08 → 16 → 32 → 64 → 28 → 56 → 12 → 24 → 48 → 96 → 92 → 84 → 68 → 36 → 72 → 44 → 88 → 76 → 52 → 04 → 08 → 16 → 32 → 64 → 28… Any number of trailing digits, 1 or 2 or one trillion, falls into a loop. It just takes longer as the number of trailing digits increases.

That’s the tail of the snake. At the other end, the head of the snake, the digits don’t fall into a loop (because of the carries from the lower digits). So, while you can get only 2, 4, 8 and 6 as the final digits of 2^p, you can get any digit but 0 as the first digit of 2^p. Indeed, I conjecture (but can’t prove) that not only will all integers eventually appear as the leading digits of 2^p, but they will do so infinitely often. Think of a number and it will appear as the leading digits of 2^p. Let’s try the numbers 1, 12, 123, 1234, 12345…:

• __1__6 = 2^4

• __12__8 = 2^7

• __123__79400392853802748... = 2^90

• __1234__0799625835686853... = 2^1545

• __12345__257952011458590... = 2^34555

• __123456__95478410965346... = 2^63293

• __1234567__3811591269861... = 2^4869721

• __12345678__260232358911... = 2^5194868

• __123456789__99199154389... = 2^62759188

But what about the numbers 9, 98, 987, 986, 98765… as leading digits of 2^p? They don’t appear as quickly:

• __9__007199254740992 = 2^53

• __98__079714615416886934... = 2^186

• __987__26397006685494828... = 2^1548

• __9876__8356967522174395... = 2^21257

• __98765__563827287722773... = 2^63296

• __987654__26081858871289... = 2^5194871

• __9876543__0693066680199... = 2^11627034

• __98765432__584491513519... = 2^260855656

• __987654321__09571471006... = 2^1641098748

Why do fragments of 123456789 appear much sooner than fragments of 987654321? Well, even though all integers occur infinitely often as leading digits of 2^p, some integers occur more often than others, as it were. The leading digits of 2^p are actually governed by a fascinating mathematical phenomenon known as Benford’s law, which states, for example, that the single first digit, d, will occur with the frequency log_{10}(1 + 1/d). Here are the actual frequencies of 1..9 for all powers of 2 up to 2^101000, compared with the estimate by Benford’s law:

1: 30% of leading digits ↔ 30.1% estimated

2: 17.55% ↔ 17.6%

3: 12.45% ↔ 12.49%

4: 09.65% ↔ 9.69%

5: 07.89% ↔ 7.92%

6: 06.67% ↔ 6.69%

7: 05.77% ↔ 5.79%

8: 05.09% ↔ 5.11%

9: 04.56% ↔ 4.57%

Because (inter alia) 1 appears as the first digit of 2^p far more often than 9 does, the fragments of 123456789 appear faster than the fragments of 987654321. Mutatis mutandis, the same applies in all other bases (apart from bases that are powers of 2, where there’s a single leading digit, 1, 2, 4, 8…, followed by 0s). But although a number like 123456789 occurs much frequently than 987654321 in 2^p expressed in base 10 (and higher), both integers occur infinitely often.

As do all other integers. And because stories can be expressed as numbers, all stories ever (and never) written appear in the powers of 2. Infinitely often. You’ll just have to trim the tail of the story-snake.