01100111 01101111 01101111 01100100 01100010 01111001 01100101
= goodbye in binary
Say
The binary code for the word "GOODBYE" can be represented using ASCII values. Each letter is converted to its 8-bit binary equivalent: G (01000111), O (01001111), O (01001111), D (01000100), B (01000010), Y (01011001), E (01000101). Therefore, "GOODBYE" in binary is: 01000111 01001111 01001111 01000100 01000010 01011001 01000101.
The binary code for the word "goodbye" can be represented using ASCII encoding. Each character is converted to its corresponding 8-bit binary value: g: 01100111 o: 01101111 o: 01101111 d: 01100100 b: 01100010 y: 01111001 e: 01100101 So, "goodbye" in binary is: 01100111 01101111 01101111 01100100 01100010 01111001 01100101.
110001010110000100100
0100110101100001011100110110111101101110
Thompson (with capital T): 0101010001101000011011110110110101110000011100110110111101101110
01
01
Thompson (with capital T): 0101010001101000011011110110110101110000011100110110111101101110
That IS the binary code.
Goodbye in Morse code is (--. --- --- -.. -... -.-- .).
That depends on your string encoding. In ascii, for example: H = 72 = 1001000 i = 105 = 1101001