Q: Can u Find a password from binary numbers 1111 0011 1001 0000 0010 0100 0000 1111 0110 1100 0111 0111 0111 1001 0101 0111 0111 1110 0100 1100 0111 1100 1001 0100 0000 0010 1011 0011 1110 0001 11100101?

Write your answer...

Submit

Still have questions?

Continue Learning about Math & Arithmetic

0000 0000 1111 1000F ( or 15) = 1111 in binary, and 8 = 1000 in binary, so F is 1111 1000

To consider the difference between straight binary and BCD, the binary numbers need to be split up into 4 binary digits (bits) starting from the units. In 4 bits there are 16 possible values from 0000 to 1111 (0 to 15). In straight binary all of these possible combinations are used, thus: 4 bits can represent the decimal numbers 0-15 8 bits can represent the decimal numbers 0-255 12 bits can represent the decimal numbers 0-4095 16 bits can represent the decimal numbers 0-65535 etc In arithmetic, all combinations of bits are used, thus: 0000 1001 + 0001 = 0000 1010 In BCD or Binary Coded Decimal, only the representations of the decimal numbers 0-9 are used (that is 0000 to 1001 in binary), and the 4-bits (nybbles) are read as decimal digits, thus: 4 bits can represent the decimal digits 0-9 8 bits can represent the decimal digits 0-99 12 bits can represent the decimal digits 0-999 16 bits can represent the decimal digits 0-9999 In arithmetic, only the representations of decimal numbers are used, thus: 0000 1001 + 0001 = 0001 0000 When BCD is used each half of a byte is read directly as a decimal digit. BCD is obviously inefficient as storage (for large numbers) as each nybble is only holding 3/8 of the possible numbers, however, it is sometimes easier and quicker to work with decimal digits (for example when there is lots of display of counting numbers to do there is less binary to decimal conversion needing to be done).

the first for numbers of a credit card is well... the first 4 numbers for ex. 0000 0000 0000 0000 the first 4 ... its simple

Floating point numbers are stored in scientific notation using base 2 not base 10.There are a limited number of bits so they are stored to a certain number of significant binary figures.There are various number of bytes (bits) used to store the numbers - the bits being split between the mantissa (the number) and the exponent (the power of 10 (being in the base of the storage - in binary, 10 equals 2 in decimal) by which the mantissa is multiplied to get the binary/decimal point back to where it should be), examples:Single precision (IEEE) uses 4 bytes: 8 bits for the exponent (encoding ±), 1 bit for the sign of the number and 23 bits for the number itself;Double precision (IEEE) uses 8 bytes: 11 bits for the exponent, 1 bit for the sign, 52 bits for the number;The Commodore PET used 5 bytes: 8 bits for the exponent, 1 bit for the sign and 31 bits for the number;The Sinclair QL used 6 bytes: 12 bits for the exponent (stored in 2 bytes, 16 bits, 4 bits of which were unused), 1 bit for the sign and 31 bits for the number.The numbers are stored normalised:In decimal numbers the digit before the decimal point is non-zero, ie one of {1, 2, ..., 9}.In binary numbers, the only non-zero digit is 1, so *every* floating point number in binary (except 0) has a 1 before the binary point; thus the initial 1 (before the binary point) is not stored (it is implicit).The exponent is stored by adding an offset of 2^(bits of exponent - 1), eg with 8 bit exponents it is stored by adding 2^7 = 1000 0000Zero is stored by having an exponent of zero (and mantissa of zero).Example 10 (decimal):10 (decimal) = 1010 in binary → 1.010 × 10^11 (all digits binary) which is stored in single precision as:sign = 0exponent = 1000 0000 + 0000 0011 = 1000 00011mantissa = 010 0000 0000 0000 0000 0000 (the 1 before the binary point is explicit).Example -0.75 (decimal):-0.75 decimal = -0.11 in binary (0.75 = ½ + ¼) → 1.1 × 10^-1 (all digits binary) → single precision:sign = 1exponent = 1000 0000 + (-0000 0001) = 0111 1111mantissa = 100 0000 0000 0000 0000 0000Note 0.1 in decimal is a recurring binary fraction 0.1 (decimal) = 0.0001100110011... in binary which is one reason floating point numbers have rounding issues when dealing with decimal fractions.

1 + 1,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111 = 1,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,111,112 Unless it is binary, in which case: 1 + 111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 1111 11111 1111 1111 1111 1111 = 1000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000

Related questions

0000 0000 1111 1000F ( or 15) = 1111 in binary, and 8 = 1000 in binary, so F is 1111 1000

It is 1 0000 0000 0011

The passcode for all Motorola Bluetooth devices is 0000

0001 0000

password 0000 for Motorola h700 bluetooth is not working

When a bit is turned on, it represents a "1". When it is turned off, it represents a "0". The exact value depends on where the bit is within the byte it is part of. In the binary number 0000 0001, the last bit is set to 1 and represents the number 1. In the binary number 0000 0010, the second to last bit is set to 1, which corresponds to the "2's" place relative to decimal numbers. In the binary number 0000 1000, the bit that is set to 1 represents the value "8" in decimal numbers.

0000

0000

00001001 can be written as 0000 1001 which is hex 09 and hence has a decimal value of 9

192 = 1100 0000 168 = 1010 1000 0 = 0000 0000 1 = 0000 0001 192.168.0.1 = 11000000.10101000.00000000.00000001 = 11000000.10101000.0.1

actually, i had a psp and the password to get thrue was 0000. my psp broke and i got a new one. the password was still 0000. try 0000

I assume you mean BCD, Binary Coded Decimal. BCD uses 4 bits to represent one decimal number. The easiest way is to make a table, with decimal, BCD, Hex and straight binary. 1 0000 0001 1 0000 0001 2 0000 0010 2 0000 0010 3 0000 0011 3 0000 0011 ...Skip a bit.... 9 0000 1001 9 0000 1001 10 0001 0000 A 0000 1010 11 0001 0001 B 0000 1011 ...Skipping again.... 15 0001 0101 F 0000 1111 16 0001 0110 10 0001 0000 Get the idea? In the first one, 4 binary bits are matched with one decimal digit. In straight binary, the number scrolls on. Interestingly, this caused some problems, earning itself the name 'the 2.1K bug'. some systems, generally small systems like Eftpos terminals, wrote values in BCD binary, but read them as straight binary. So dates were written in BCD 10, but read back as (check the table) Ordinary binary 16. Hilarity ensued.