# The Devil’s Digits

As I’ve said before, I love the way that numbers can come in many different guises. For example, take the number 21. It comes in all these guises:

21 = 10101 in base 2 = 210 in base 3 = 111 in b4 = 41 in b5 = 33 in b6 = 30 in b7 = 25 in b8 = 23 in b9 = 21 in b10 = 1A in b11 = 19 in b12 = 18 in b13 = 17 in b14 = 16 in b15 = 15 in b16 = 14 in b17 = 13 in b18 = 12 in b19 = 11 in b20 = 10 in b21

But I’ve not chosen 21 at random. If you sum the 1s in the representations of 21 in bases 2 to 21, look what you get:

21 = 10101 in base 2 = 210 in base 3 = 111 in b4 = 41 in b5 = 33 in b6 = 30 in b7 = 25 in b8 = 23 in b9 = 21 in b10 = 1A in b11 = 19 in b12 = 18 in b13 = 17 in b14 = 16 in b15 = 15 in b16 = 14 in b17 = 13 in b18 = 12 in b19 = 11 in b20 = 10 in b21

21 = 1s=101s=201s=3 in base 2 = 21s=40 in base 3 = 111s=7 in b4 = 41s=8 in b5 = 33 in b6 = 30 in b7 = 25 in b8 = 23 in b9 = 21s=9 in b10 = 1s=10A in b11 = 1s=119 in b12 = 1s=128 in b13 = 1s=137 in b14 = 1s=146 in b15 = 1s=155 in b16 = 1s=164 in b17 = 1s=173 in b18 = 1s=182 in b19 = 11s=20 in b20 = 1s=210 in b21

In other words, 21 = digcount(21,dig=1,base=2..21). But n = digcount(n,dig,b=2..n) doesn’t happen for any other digit and doesn’t happen often with 1:

3 = digcount(3,d=1,b=2..3) = 11 in b2 = 10 in b3
4 = digcount(4,d=1,b=2..4) = 100 in b2 = 11 in b3 = 10 in b4
6 = digcount(6,d=1,b=2..6) = 110 in b2 = 20 in b3 = 12 in b4 = 11 in b5 = 10 in b6
10 = digcount(10,d=1) = 1010 in b2 = 101 in b3 = 22 in b4 = 20 in b5 = 14 in b6 = 13 in b7 = 12 in b8 = 11 in b9 = 10 in b10
15 = digcount(15,d=1) = 1111 in b2 = 120 in b3 = 33 in b4 = 30 in b5 = 23 in b6 = 21 in b7 = 17 in b8 = 16 in b9 = 15 in b10 = 14 in b11 = 13 in b12 = 12 in b13 = 11 in b14 = 10 in b15
21 = digcount(21,d=1) = 10101 in b2 = 210 in b3 = 111 in b4 = 41 in b5 = 33 in b6 = 30 in b7 = 25 in b8 = 23 in b9 = 21 in b10 = 1A in b11 = 19 in b12 = 18 in b13 = 17 in b14 = 16 in b15 = 15 in b16 = 14 in b17 = 13 in b18 = 12 in b19 = 11 in b20 = 10 in b21

After that, the digcount(n,d=1,b=2..n) → n/2 (see “Digital Dissection” for further discussion). But I decided to look for the first n where digcount(n,dig,b=2..n) = 666:

digcount(1270,1) = 666
digcount(3770,2) = 666
digcount(7667,3) = 666
digcount(12184,4) = 666
digcount(18845,5) = 666
digcount(25806,6) = 666
digcount(34195,7) = 666
digcount(43352,8) = 666
digcount(54693,9) = 666

It doesn’t stop there, of course. You can carry on for ever, looking for digcount(n,A) = 666, digcount(n,B) = 666, digcount(n,C) = 666, where A = 10, B = 11 and C=12, and so on. But it doesn’t start there, either. What about digcount(n,0) = 666? That isn’t easy to find, because 0 usually occurs far less often than other digits in the representation of n. Here are the integers setting records for digcount(n,0,b=2..n):

2 → digcount(2,0) = 1 ← 2= 10 in base 2
4 → digcount(4,0) = 3; ← 4 = 100 in base 2, 11 in base 3, 10 in base 4
8 → digcount(8,0) = 5 ← 8 = 1000 in base 2, 22 in base 3, 20 in base 4, 13 in base 5, 12 in base 6, 11 in base 7, 10 in base 8
12 → digcount(12,0) = 6
16 → digcount(16,0) = 8
18 → digcount(18,0) = 9
32 → digcount(32,0) = 11
36 → digcount(36,0) = 13
64 → digcount(64,0) = 15
72 → digcount(72,0) = 18
128 → digcount(128,0) = 20
144 → digcount(144,0) = 24
252 → digcount(252,0) = 25
264 → digcount(264,0) = 27
288 → digcount(288,0) = 29
360 → digcount(360,0) = 30
504 → digcount(504,0) = 33
540 → digcount(540,0) = 36
720 → digcount(720,0) = 40
900 → digcount(900,0) = 42
1080 → digcount(1080,0) = 47
1680 → digcount(1680,0) = 48
1800 → digcount(1800,0) = 53
2160 → digcount(2160,0) = 56
2520 → digcount(2520,0) = 61
3600 → digcount(3600,0) = 64
4320 → digcount(4320,0) = 66

So what is the first n for which digcount(n,0) = 666? Watch this space.

# DeVil to Power

666 is the Number of the Beast described in the Book of Revelation:

13:18 Here is wisdom. Let him that hath understanding count the number of the beast: for it is the number of a man; and his number is Six hundred threescore and six.

But 666 is not just diabolic: it’s narcissistic too. That is, it mirrors itself using arithmetic, like this:

666^47 =

5,049,969,684,420,796,753,173,148,798,405,
564,772,941,516,295,265,408,188,117,632,
668,936,540,446,616,033,068,653,028,889,
892,718,859,670,297,563,286,219,594,665,
904,733,945,856 → 5 + 0 + 4 + 9 + 9 + 6 + 9 + 6 + 8 + 4 + 4 + 2 + 0 + 7 + 9 + 6 + 7 + 5 + 3 + 1 + 7 + 3 + 1 + 4 + 8 + 7 + 9 + 8 + 4 + 0 + 5 + 5 + 6 + 4 + 7 + 7 + 2 + 9 + 4 + 1 + 5 + 1 + 6 + 2 + 9 + 5 + 2 + 6 + 5 + 4 + 0 + 8 + 1 + 8 + 8 + 1 + 1 + 7 + 6 + 3 + 2 + 6 + 6 + 8 + 9 + 3 + 6 + 5 + 4 + 0 + 4 + 4 + 6 + 6 + 1 + 6 + 0 + 3 + 3 + 0 + 6 + 8 + 6 + 5 + 3 + 0 + 2 + 8 + 8 + 8 + 9 + 8 + 9 + 2 + 7 + 1 + 8 + 8 + 5 + 9 + 6 + 7 + 0 + 2 + 9 + 7 + 5 + 6 + 3 + 2 + 8 + 6 + 2 + 1 + 9 + 5 + 9 + 4 + 6 + 6 + 5 + 9 + 0 + 4 + 7 + 3 + 3 + 9 + 4 + 5 + 8 + 5 + 6 = 666

666^51 =

993,540,757,591,385,940,334,263,511,341,
295,980,723,858,637,469,431,008,997,120,
691,313,460,713,282,967,582,530,234,558,
214,918,480,960,748,972,838,900,637,634,
215,694,097,683,599,029,436,416 → 9 + 9 + 3 + 5 + 4 + 0 + 7 + 5 + 7 + 5 + 9 + 1 + 3 + 8 + 5 + 9 + 4 + 0 + 3 + 3 + 4 + 2 + 6 + 3 + 5 + 1 + 1 + 3 + 4 + 1 + 2 + 9 + 5 + 9 + 8 + 0 + 7 + 2 + 3 + 8 + 5 + 8 + 6 + 3 + 7 + 4 + 6 + 9 + 4 + 3 + 1 + 0 + 0 + 8 + 9 + 9 + 7 + 1 + 2 + 0 + 6 + 9 + 1 + 3 + 1 + 3 + 4 + 6 + 0 + 7 + 1 + 3 + 2 + 8 + 2 + 9 + 6 + 7 + 5 + 8 + 2 + 5 + 3 + 0 + 2 + 3 + 4 + 5 + 5 + 8 + 2 + 1 + 4 + 9 + 1 + 8 + 4 + 8 + 0 + 9 + 6 + 0 + 7 + 4 + 8 + 9 + 7 + 2 + 8 + 3 + 8 + 9 + 0 + 0 + 6 + 3 + 7 + 6 + 3 + 4 + 2 + 1 + 5 + 6 + 9 + 4 + 0 + 9 + 7 + 6 + 8 + 3 + 5 + 9 + 9 + 0 + 2 + 9 + 4 + 3 + 6 + 4 + 1 + 6 = 666

But those are tiny numbers compared to 6^(6^6). That means 6^46,656 and equals roughly 2·6591… x 10^36,305. It’s 36,306 digits long and its full digit-sum is 162,828. However, 666 lies concealed in those digits too. To see how, consider the function Σ(x1,xn), which returns the sum of digits 1 to n of x. For example, π = 3·14159265…, so Σ(π14) = 3 + 1 + 4 + 1 = 9. The first 150 digits of 6^(6^6) are these:

26591197721532267796824894043879185949053422002699
24300660432789497073559873882909121342292906175583
03244068282650672342560163577559027938964261261109
… (150 digits)

If x = 6^(6^6), then Σ(x1,x146) = 666, Σ(x2,x148) = 666, and Σ(x2,x149) = 666.

There’s nothing special about these patterns: infinitely many numbers are narcissistic in similar ways. However, 666 has a special cultural significance, so people pay it more attention and look for patterns related to it more carefully. Who cares, for example, that 667 = digit-sum(667^48) = digit-sum(667^54) = digit-sum(667^58)? Fans of recreational maths will, but not very much. The Number of the Beast is much more fun, narcissistically and otherwise:

666 = digit-sum(6^194)
666 = digit-sum(6^197)

666 = digit-sum(111^73)
666 = digit-sum(111^80)

666 = digit-sum(222^63)
666 = digit-sum(222^66)

666 = digit-sum(333^58)
666 = digit-sum(444^53)
666 = digit-sum(777^49)
666 = digit-sum(999^49)