I'm not sure if the devas just automatically understood binary as a language, but one way to decipher binary machiene language is to translate it into ascii characters (which is what I intend to explain since it seems like the simplest way to go).
If you've ever tried to make a code before, you may have had A=1 and Z=26. 2 would represent B, 3 equals C, etc.
So if I gave you the code 4,9,7,9,13,15,14 could you decipher it using the key below?
| A=1 | E=5 | I=9 | M=13 | Q=17 | U=21 | Y=25 |
| B=2 | F=6 | J=10 | N=14 | R=18 | V=22 | Z=26 |
| C=3 | G=7 | K=11 | 0=15 | S=19 | W=23 | |
| D=4 | H=8 | L=12 | P=16 | T=20 | X=24 | |
What if I took the commas away and wrote 04090709131514? Then, you would have to separate every 2 characters. If I wrote 4090709131514, then you could separate every two characters starting from the right and going left.
So with A=1 and Z=26, 4,9,7,9,13,15,14 = 04090709131514 = 4090709131514 = DIGIMON
Perhaps you wanted to make the code a little harder to decipher, so you made A=26 and Z=1. B=25, C=24,etc. Then 23182018141213 = DIGIMON.
In ASCII they make A=65 and Z=90.
| A=65 | E=69 | I=73 | M=77 | Q=81 | U=85 | Y=89 |
| B=66 | F=70 | J=74 | N=78 | R=82 | V=86 | Z=90 |
| C=67 | G=71 | K=75 | 0=79 | S=83 | W=87 | |
| D=68 | H=72 | L=76 | P=80 | T=84 | X=88 | |
DIGIMON = 68737173777978 = 68,73,71,73,77,79,78
but deciphering down to binary, of course, doesn't stop here
eventually 68 = 01000100 = D allow me to explain
68 = 64 + 4
Think of '1' symbolizing 'on' and '0'symbolizing off.
Don't freak out if you don't understand the following:
................................................................
2 to the 0 power equals 1.
2 to the 1 power equals 2.
2 to the 2 power equals 4. In other words, 2x2=4.
2 to the 3 power equals 8. In other words, 2x2x2=8.
2 to the 4 power equals 16. In other words, 2x2x2x2=16.
2 to the 5 power equals 32. In other words, 2x2x2x2x2=32.
2 to the 6 power equals 64. In other words, 2x2x2x2x2x2=64.
2 to the 7 power equals 128. In other words, 2x2x2x2x2x2x2=128.
10 to the 0 power equal 1.
10 to the 1 power equal 10.
10 to the 2 power equal 100. In other words, 10x10=100.
10 to the 3 power equal 1000. In other words, 10x10x10=1000.
In our number system we have the one's place, the ten's, place, the hundred's place, and the thousand's place.
Techically that is called 'base 10.'
In base 2, we have the one's place, the two's place, the four's place, and the eight's place instead.
So instead of:
1000, 100 10 1
or
10000000 1000000, 100000 10000 1000, 100 10 1
in bianary it's:
8 4 2 1
or
128 64 32 16, 8 4 2 1
In base 10 we use the whole numbers 0-9.
In base 2 we use the whole numbers 0-1.
.................................................
So
If you want the sum to be 68, what do you add together to get 68, out of the numbers 128, 64, 32, 16, 8, 4, 2, and 1 if you can only have 1 of each number?
128 is greater than 68, so you will want zero 128's.
64 is the closest number that is less than 68, so we will want one 64.
68-64=4 so we will want one 4.
So put a 1 in the 64's place and a 1 in the 4's place. Fill in the rest with zeros.
0 1 0 0 0 1 0 0
128 64 32 16 8 4 2 1
68 = 64+4 = 01000100 = D
73 = 64+8+1 = 01001001 = I
71 = 64+4+2+1 = 01000111 = G
77 = 64+8+4+1 = 01001101 = M
79 = 64+8+4+2+1 = 01001111 = O
78 = 64+8+4+2 = 01001110 = N
01000100010010010100011101001001010011010100111101001110 = DIGIMON