Challenge
Given a natural number, output it in the ASCII form of Agrippa's number system.
Description
I like odd alphabets and numeral systems. My favorite numeral system is one given by Heinrich Cornelius Agrippa. It gives a succinct way to write numbers in the range [0,9999]
, where single digits are written as follows:
Larger numbers less than 10^4
are a combination of single digits, but rotated/horizontally-mirrored on a single central bar as follows:
[0° mirrored, 10's ] | [0°, 1's ]
[180°, 1000's] | [180° mirrored, 100's]
Here are a few examples:
The ASCII equivalents are:
Ones:
0 1 2 3 4 5 6 7 8 9
| |- |_ |\ |/ |~ || |^ |v |]
| | | | | | | | | |
Tens:
0 1 2 3 4 5 6 7 8 9
| -| _| /| \| ~| || ^| v| [|
| | | | | | | | | |
Hundreds:
0 1 2 3 4 5 6 7 8 9
| | | | | | | | | |
| |_ |- |/ |\ |~ || |v |^ |]
Thousands:
0 1 2 3 4 5 6 7 8 9
| | | | | | | | | |
| _| -| \| /| ~| || v| ^| [|
1510: 1511: 1471: 1486: 3421:
-| -|- ^|- v|| _|-
_|~ _|~ _|\ -|\ \|\
Numbers larger than 9999
are broken up into sections of 4 digits (with leading zeros added to get a multiple of four) and each is converted. For example:
314159: (0031 4159)
/|- ~|]
| /|_
Rules
- Your answer may be a function or full program
- The input is a positive integer
- Entries must support inputs over
10^8
- Each four digit section takes exactly six characters
- Sections of four are separated by a single space
- Trailing newline is optional
- Up to two trailing spaces per line are allowed
- I will not accept my own answer
- Score is in bytes, lowest score wins!