What is the decimal equivalent of the decimal number 65?

65 (decimal.)

1000001 (binary) decimal integer is converted to a binary integer"Divide by 2 and take the remainder and arrange them in reverse order"Law. Here's how: divide a decimal integer by 2 to get a quotient and remainder.

Removing the quotient with 2 gives you a quotient and remainder, and so on until the quotient is less than 1, and then takes the remainder obtained first as a binary number.

, and the resulting remainder is arranged sequentially as the high significant digits of the binary number. The reason why the computer uses binary: 1. The binary counting system only uses two digits.

0 and 1, so any component with two different steady states can be used to represent one of the digits of the number. In fact, there are many components that have two distinct steady states. For example, neon lamps.

of"Bright"with"Off"；"on" and "off" of switches; "high" and "low", "positive" and "negative" voltage; The "holes" and "non-holes" on the paper tape, the "signaled" and "non-signaled" in the circuit, the south and north poles of magnetic materials, and so on. It's easy to use these disparate states to represent numbers. Not only that, but more importantly, the two very different states are not only qualitatively different, but also qualitatively different.

In this way, the anti-interference ability of the machine can be greatly improved, and the reliability can be improved. It is much more difficult to find a simple and reliable device that can represent more than two states. 2. The four rules of operation of the binary counting system are very simple.

And the four operations can be boiled down to addition and shifting, so that the electronic computer.

The combinator circuits in are also much simpler. Not only that, but the line is simplified, and the speed can be increased. This is also incomparable to the decimal counting system.

3. The use of binary representation in electronic computers can save equipment. It can be theoretically proved that the triplet system is the most cost-effective, followed by the binary system.

However, due to the advantages of binary systems, including the ternary system, which are not found in other carry systems, most electronic computers still use binary. In addition, since only two symbols "0" and "1" are used in binary, Boolean algebra can be used to analyze and synthesize the logical circuits in the machine. This provides a useful tool for designing electronic computer circuits.

4. The binary symbols "1" and "0" correspond to the "true" and "false" in the logical operation, which is convenient for the computer to carry out logical operations. The above content reference: Encyclopedia-Binary.

So the hexadecimal number is 41.

41 mobile phone calculators can be calculated.

65 = 64 + 1 = 2 to the 6th power + 1

Known as binary 1000001

Please praise the mobile phone questioner in the upper right corner of the client to comment [satisfied].

If there are new questions, please do not send them in the form of follow-up questions, send another questions and ask me for help or send the link address of the question in the follow-up area, it is not easy to answer the questions, please understand

o( o, remember to praise and adopt, help each other.

Good luck with your studies!

The hand calculation method is divided by 16 inverse remainder:

577 16 = 36 remainder 1

36 16 = 2 and 4

2 16 = 0 more than 2

The remainder is arranged in reverse order to give 241.

The binary number of 16 is 10000. Common decimal systems are binary, octal, and hexadecimal. How to convert a number from decimal to binary can be divided by using the remainder short division.

16÷2=8，8÷2=4，4÷2=2，2÷2=1。Divide to the remainder is not divisible by 2. Finally, write the remainder from the bottom up, and write 00001 in reverse, which is 10000.

Logical operations on binary numbersIn formal logic, the Logic Strike Operator or Logical Junction Zen Wandering Words connect sentences into more complex and complex statements. For example, suppose there are two logical propositions, "It's raining" and "I'm in the house," and we can combine them into complex propositions "It's raining, and I'm in the house" or "It's not raining" or "If it's raining, then I'm in the house." A new statement or proposition that combines two statements is called a compound statement or compound proposition.

4625=1 16 16 16+2 16 16+1 16+1, so the hexadecimal number equivalent to 4625 is 1211.

Note.

On the nth (n starts at 0) bit, if it is the number x (x is greater than or equal to 0 and x is less than or equal to 15, i.e., f) is represented by the nth power of the size x * 16.

Today's decimal hexadecimal system is commonly used in computer applications because it is not too difficult to convert 4 bits into individual hexadecimal numbers. 1 byte can be represented as 2 consecutive hexadecimal digits. However, this hybrid notation can be confusing, so it requires some initials, endings, or subscripts to display.

The specific algorithm for converting hexadecimal to decimal is:

1. First of all, understand the hexadecimal number (from right to left the number is the 0th, 1st, 2nd......The 0th place has a weight of 16 to the power of 0, the first place has a weight of 16 to the 1st power, and the 2nd place has a weight of 16 to the 2nd power, and so on.

2. Understand that the binary digits represented by ABCDEF are 10, 11, 12, 13, 14, and 15.

3. The formula for converting hexadecimal to decimal is: from right to left, use each number in binary to multiply it by the corresponding power of 16, and then add these numbers together.

Example 1: 2af5 to decimal system:

Bit 0: 5 * 16 0 = 5

1st place: f * 16 1 = 15 * 16 1 = 240

2nd place: a * 16 2 = 10 * 16 2 = 2560

3rd place: 2 * 16 3 = 8192

The result is: 5 * 16 0 + 15 * 16 1 + 10 * 16 2 + 2 * 16 3 = 10997

Example 2: Convert CE to decimal system:

Bit 0: e*16 0=14*16 0=14

1st place: c*16 1=12*16 1=192

The result is: 14*16 0+12*16 1=206

The hexadecimal system is every 16 into 1, and each bit can be from small to large as, a, b, c, d, e, f, a total of 16 numbers of different sizes. Hexadecimal conversion is the conversion between hexadecimal and other different base systems.

To convert the octal number 66 to a decimal number, you need to multiply each digit by its corresponding weight (to the power of 8) and add it up. Here are some examples:

Calculate the power of 8:

Next, the multiplication calculation is complete:

Finally, the two parts are added to the family before the repentance is eliminated

Therefore, the decimal number 66 is equal to the decimal number 54.

The steps for the octal number 66 to convert the number to the decimal number are: 6 8 0 + 6 8 1 = 6 1 + 6 8 = 6 + 48 = 54. Therefore, the octal number 66 is equal to the ten-bureau state number 54.

The calculation method of converting the number of 66 into the decimal number of 66 into the decimal number is as follows: Qingsen returns:

Therefore, the decimal number 66 is equal to the decimal number 54.

65 in decimal

1) Convert to binary:

Put the remainder. I connect them from the bottom up and get them.

It's binary.

2) Convert to octal.

Put binary numbers.

From right to left, group by three digits, and add 0 in front of less than three digits:

Each group is converted into an octal number according to the following rules:

After conversion, it is 401, which is octal.

3) Convert to hexadecimal.

Following the octal practice, grouped by four digits, the law is:

0001-1，0010-2，0011-3，0100-40101-5，0110-6，0111-7，1000-81001-9，1010-a，1011-b，1100c-1101-d，1110-e，1111-f

0100 0001->41, that's hexadecimal.

Shortcut Method (Hexadecimal Conversion) - Integer Part: The remainder method is used by dividing the base, the base is 16, 56 2, the quotient is 3, and the remainder is 8

3 2, quotient 0, remaining 3

From top to bottom, there are one digits and then tens, so the final result is (38) 16.

Conventional method - integer part:

The base number is 2,56 2, quotient 28, and the remainder is 0

28 2, quotient 14, surplus 0

14 2, quotient 7, surplus 0

7 2, quotient 3, Yu 1

3 2, quotient 1, surplus 1

1 2, quotient 0, remaining 1

From top to bottom, it is a bit, a ten, a hundred, a thousand, a thousand, a hundred thousand, and a hundred thousand, so the final result is (111000)2.