• 48.1k
• 6
• 130
• 187

• 48.1k
• 6
• 130
• 187

• 48.1k
• 6
• 130
• 187

Hexagony, 261 bytes, side length 10

113009344778658560261693601386118648881408495353228771273368412312382314076924170567897137624629445942109467..../....%'=g':..\..................\.................\................\...............\..............\.............\............\!$/'?))='%<\..>:;/$;4Q/

Try it online!

Uses the same encoding user202729's answer, but terminates in a divide by zero error.

Formatted, this looks like:

 1 1 3 0 0 9 3 4 4 7
 7 8 6 5 8 5 6 0 2 6 1
 6 9 3 6 0 1 3 8 6 1 1 8
 6 4 8 8 8 1 4 0 8 4 9 5 3
 5 3 2 2 8 7 7 1 2 7 3 3 6 8
 4 1 2 3 1 2 3 8 2 3 1 4 0 7 6
 9 2 4 1 7 0 5 6 7 8 9 7 1 3 7 6
 2 4 6 2 9 4 4 5 9 4 2 1 0 9 4 6 7
 . . . . / . . . . % ' = g ' : . . \
 . . . . . . . . . . . . . . . . . . \
 . . . . . . . . . . . . . . . . . \
 . . . . . . . . . . . . . . . . \ 
 . . . . . . . . . . . . . . . \ 
 . . . . . . . . . . . . . . \ 
 . . . . . . . . . . . . . \
 . . . . . . . . . . . . \
 ! $ / ' ? ) ) = ' % < \
 . . > : ; / $ ; 4 Q /

Try it online!

Some python-like psuedo-code to explain:

n = ridiculously long number
base = 103
print(n)
while n > 0:
 b = 2
 if n%b == 1:
 c = '.'
 print(c)
 else:
 n = n//b
 b = base
 c = chr(n%b + 1)
 print(c)
 n = n//b

I'm using base 103 rather than the optimal base 97 just to make sure the number fully fits the top half of the hexagon and doesn't leave an extra . to encode.