Want this question answered?
A002B07D16 -> binary A 1010 0 0000 0 0000 2 0010 B 1011 0 0000 7 0111 D 1101 A002B07D16 = 1010 0000 0000 0010 1011 0000 0111 11012 10 100 000 000 000 101 011 000 001 111 1012 -> octal 010 2 100 4 000 0 000 0 000 0 101 5 011 3 000 0 001 1 111 7 101 5 10 100 000 000 000 101 011 000 001 111 1012 = 240005301758 A002B07D16 = 24 000 530 1758
Convert each "digit" of the octal into a triplet of binary digits, according to the following rule: Octal Binary 0 000 1 001 2 010 3 011 4 100 5 101 6 110 7 111 So, for example, octal 53 = binary 101 011 [= decimal 43]
Convert every octal digit into three binary digit: 0->000 1->001 2->010 3->011 4->100 5->101 6->110 7->111
Divide the binary number into 3 bit segments starting from the right, then convert each 3 bit section into its decimal equivalent. 111 011 110 101 = 7 3 6 5 (111 = 7, 011 = 3, 110 = 6, and 101 = 5).
101 is the smallest 3 digit Prime number.
10110110 = 11 000 101 011 101 1012
A002B07D16 -> binary A 1010 0 0000 0 0000 2 0010 B 1011 0 0000 7 0111 D 1101 A002B07D16 = 1010 0000 0000 0010 1011 0000 0111 11012 10 100 000 000 000 101 011 000 001 111 1012 -> octal 010 2 100 4 000 0 000 0 000 0 101 5 011 3 000 0 001 1 111 7 101 5 10 100 000 000 000 101 011 000 001 111 1012 = 240005301758 A002B07D16 = 24 000 530 1758
55. 101 in binary is 5. there is a shortcut in getting the equivalent in binary. 421 if it is 1, then it's 001. if it is 2, then it's 010. if it is 3, then it's 011. if it is 4, then it's 100. if it is 5, then it's 101. see? you just have to add the numbers that you need. you'll write 1 when you used the number that is needed and 0 when not.
input: 76543210(8) output: 111 110 101 100 011 010 001 000(2)
Each digit represents 3 bits. 0 = 000 1 = 001 2 = 010 3 = 011 4 = 100 5 = 101 6 = 110 7 = 111
Convert each "digit" of the octal into a triplet of binary digits, according to the following rule: Octal Binary 0 000 1 001 2 010 3 011 4 100 5 101 6 110 7 111 So, for example, octal 53 = binary 101 011 [= decimal 43]
Three of them ... the binary numbers 3, 5, and 6. 011 101 110
Convert every octal digit into three binary digit: 0->000 1->001 2->010 3->011 4->100 5->101 6->110 7->111
The only numbers that divide evenly into 101 are 101 and 1. This means that 101 is a prime number.
Divide the binary number into 3 bit segments starting from the right, then convert each 3 bit section into its decimal equivalent. 111 011 110 101 = 7 3 6 5 (111 = 7, 011 = 3, 110 = 6, and 101 = 5).
1 001 101.
There are an infinite number of composite numbers after 101.