ā¹ļø Skipped - page is already crawled
| Filter | Status | Condition | Details |
|---|---|---|---|
| HTTP status | PASS | download_http_code = 200 | HTTP 200 |
| Age cutoff | PASS | download_stamp > now() - 6 MONTH | 0.1 months ago |
| History drop | PASS | isNull(history_drop_reason) | No drop reason |
| Spam/ban | PASS | fh_dont_index != 1 AND ml_spam_score = 0 | ml_spam_score=0 |
| Canonical | PASS | meta_canonical IS NULL OR = '' OR = src_unparsed | Not set |
| Property | Value | ||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| URL | https://numeral-systems.com/binary-multiply/ | ||||||||||||||||||
| Last Crawled | 2026-04-21 01:39:04 (1 day ago) | ||||||||||||||||||
| First Indexed | 2024-05-19 22:01:55 (1 year ago) | ||||||||||||||||||
| HTTP Status Code | 200 | ||||||||||||||||||
| Content | |||||||||||||||||||
| Meta Title | Multiplying binary numbers - Online-Calculator | ||||||||||||||||||
| Meta Description | This calculator can be used to multiply 2 binary numbers. The numbers may be negative and contain a binary point. | ||||||||||||||||||
| Meta Canonical | null | ||||||||||||||||||
| Boilerpipe Text | Multiplying binary numbers
2 binary numbers are multiplied in the same way as 2 decimal numbers are multiplied. First, the two binary numbers to be multiplied are written down.
All digits of the second number are then multiplied by the first number and written underneath each other so that the number is shifted to the left by as many digits as there are places after the current digit in the second number. For better clarity, the empty spaces to the right of the numbers can be marked with an āxā or a dot. However, this is not necessary. If the current digit is a 0 and the product is therefore 0, then often as many zeros are written down as the first number has digits instead of just one 0.
It doesn't matter whether you start with the first or the last digit of the second number.
Then, starting from the right, for each column the sum of the numbers in this column is calculated. If the sum of a column is 0 or 1, it is written in the row for the solution.
Carryovers:
If the sum of the numbers in a column is greater than 1, then the last digit of the sum converted into a binary number is written in the row for the solution, and what comes before the last digit is written in the row for the carryovers one column to the left. The carryovers can be written down as binary numbers. However, when adding up the next column, it must be taken into account that the number in the row for the carryover is a binary number. It is simpler and more compact if the carryovers are written down as decimal numbers.
For example, if the sum of the numbers in a column is 3, the number is first converted into a binary number. This results in 11
2
. The back 1 is written in the row for the solution and the front 1 in the row for the carryovers.
If the sum of the numbers in a column is 10, this results in 1010
2
when converted into a binary number. The trailing 0 is written in the row for the solution and 101
2
is converted into a decimal number. This results in 5. And this 5 is written in the row for the carryovers one column to the left.
Example:
As an example, 1111
2
ā 111
2
is to be calculated.
In the last column there is only one 1, so the 1 is written in the row for the solution.
The sum of the numbers in the second last row is 2. Converted into a binary number, this is 10
2
. The 0 is written in the row for the solution and the 1 in the row for the carryovers one column to the left.
In the next column, the sum of the numbers is 4, which is 100
2
in the binary system. The 0 is written in the row for the solution and because 10
2
is 2 in the decimal system, a 2 is written in the row for the carryovers.
In the fourth column from the right, the sum is 5, which corresponds to 101
2
. So a 1 is written in the row for the solutions and a 2 in the row for the carryovers.
In the next column, the sum is again 4 and therefore a 0 is written in the row for the solution and the carry is 2.
Then the sum is 3, which corresponds to 11
2
. So a 1 is written in both the row for the solution and the row for the carryovers.
alternative calculation of the carryovers:
The sum of a column does not have to be converted into a binary number to determine the carryover and the number that is written in the row for the solution. Instead, the sum can also be divided by 2. If the sum is divisible by 2, then a 0 is written in the row for the solution, otherwise a 1. To determine the carryover, the sum is divided by 2 and rounded down.
For example, if the sum of the numbers in a column is 5, then a 1 is written in the row for the solutions because 5 is not divisible by 2. To calculate the carryover, 5 is divided by 2. This results in 2.5 and if you round the 2.5 down, you get 2.
Numbers with binary points:
If at least one of the two factors is a number with a binary point, each digit of the second number is multiplied by the first number in the same way as for binary numbers without a binary point. The binary points of the first number can be included, but they can also be omitted.
Then, as with the multiplication of binary numbers without binary points, the row for the solution and the row for the carryovers are calculated. When doing this, the binary points are not taken into account.
The binary point is placed in the solution so that the solution has as many places behind the binary point as the two factors together. | ||||||||||||||||||
| Markdown | [](https://numeral-systems.com/)
- Positional notation system
- [Numeral system converter](https://numeral-systems.com/converter/)
- [Binary - decimal converter](https://numeral-systems.com/binary-decimal/)
- [Hexadecimal - decimal converter](https://numeral-systems.com/hexadecimal-decimal/)
- [Binary - hexadecimal converter](https://numeral-systems.com/binary-hexadecimal/)
- [Adding binary numbers - calculator](https://numeral-systems.com/binary-add/)
- [Subtracting binary numbers - calculator](https://numeral-systems.com/binary-subtract/)
- [Multiplying binary numbers - calculator](https://numeral-systems.com/binary-multiply/)
- [Dividing binary numbers - calculator](https://numeral-systems.com/binary-divide/)
- IEEE-754 floating point numbers
- [IEEE-754 - floating point converter](https://numeral-systems.com/ieee-754-converter/)
- [Addition + Subtraction (IEEE-754)](https://numeral-systems.com/ieee-754-add/)
- [Multiplication (IEEE-754)](https://numeral-systems.com/ieee-754-multiply/)
- [Division (IEEE-754)](https://numeral-systems.com/ieee-754-divide/)
- Other numeral systems
- [BCD code converter](https://numeral-systems.com/bcd/)
- [Roman Numerals Converter](https://numeral-systems.com/roman-numerals/)
# Multiplying binary numbers - Calculator
settings:
| | |
|---|---|
| | start with the first digit of the second number |
| | carryovers are below |
| | factors side by side |
| | mark omitted fields with a cross |
| | omit binary points that are not required |
| | only one 0 for rows where the product is 0 |
| | marks when the mouse pointer is over a number or a comma |
copy URL
URL copied
advertisement
## About the calculator
This online calculator can be used to multiply 2 binary numbers. The numbers may be negative and contain a binary point.
advertisement
## Multiplying binary numbers
2 binary numbers are multiplied in the same way as 2 decimal numbers are multiplied. First, the two binary numbers to be multiplied are written down.
[](https://numeral-systems.com/media/binary_multiply/task.webp)
All digits of the second number are then multiplied by the first number and written underneath each other so that the number is shifted to the left by as many digits as there are places after the current digit in the second number. For better clarity, the empty spaces to the right of the numbers can be marked with an āxā or a dot. However, this is not necessary. If the current digit is a 0 and the product is therefore 0, then often as many zeros are written down as the first number has digits instead of just one 0.
[](https://numeral-systems.com/media/binary_multiply/calculation.webp)
It doesn't matter whether you start with the first or the last digit of the second number.
[](https://numeral-systems.com/media/binary_multiply/calculation_reverse.webp)
Then, starting from the right, for each column the sum of the numbers in this column is calculated. If the sum of a column is 0 or 1, it is written in the row for the solution.
[](https://numeral-systems.com/media/binary_multiply/binary_multiply.webp)
### Carryovers:
If the sum of the numbers in a column is greater than 1, then the last digit of the sum converted into a binary number is written in the row for the solution, and what comes before the last digit is written in the row for the carryovers one column to the left. The carryovers can be written down as binary numbers. However, when adding up the next column, it must be taken into account that the number in the row for the carryover is a binary number. It is simpler and more compact if the carryovers are written down as decimal numbers.
For example, if the sum of the numbers in a column is 3, the number is first converted into a binary number. This results in 112. The back 1 is written in the row for the solution and the front 1 in the row for the carryovers.
If the sum of the numbers in a column is 10, this results in 10102 when converted into a binary number. The trailing 0 is written in the row for the solution and 1012 is converted into a decimal number. This results in 5. And this 5 is written in the row for the carryovers one column to the left.
#### Example:
As an example, 11112 ā 1112 is to be calculated.
In the last column there is only one 1, so the 1 is written in the row for the solution.
[](https://numeral-systems.com/media/binary_multiply/carryover1.webp)
The sum of the numbers in the second last row is 2. Converted into a binary number, this is 102. The 0 is written in the row for the solution and the 1 in the row for the carryovers one column to the left.
[](https://numeral-systems.com/media/binary_multiply/carryover2.webp)
In the next column, the sum of the numbers is 4, which is 1002 in the binary system. The 0 is written in the row for the solution and because 102 is 2 in the decimal system, a 2 is written in the row for the carryovers.
[](https://numeral-systems.com/media/binary_multiply/carryover3.webp)
In the fourth column from the right, the sum is 5, which corresponds to 1012. So a 1 is written in the row for the solutions and a 2 in the row for the carryovers.
[](https://numeral-systems.com/media/binary_multiply/carryover4.webp)
In the next column, the sum is again 4 and therefore a 0 is written in the row for the solution and the carry is 2.
[](https://numeral-systems.com/media/binary_multiply/carryover5.webp)
Then the sum is 3, which corresponds to 112. So a 1 is written in both the row for the solution and the row for the carryovers.
[](https://numeral-systems.com/media/binary_multiply/carryover6.webp)
[](https://numeral-systems.com/media/binary_multiply/carryover7.webp)
#### alternative calculation of the carryovers:
The sum of a column does not have to be converted into a binary number to determine the carryover and the number that is written in the row for the solution. Instead, the sum can also be divided by 2. If the sum is divisible by 2, then a 0 is written in the row for the solution, otherwise a 1. To determine the carryover, the sum is divided by 2 and rounded down.
For example, if the sum of the numbers in a column is 5, then a 1 is written in the row for the solutions because 5 is not divisible by 2. To calculate the carryover, 5 is divided by 2. This results in 2.5 and if you round the 2.5 down, you get 2.
### Numbers with binary points:
If at least one of the two factors is a number with a binary point, each digit of the second number is multiplied by the first number in the same way as for binary numbers without a binary point. The binary points of the first number can be included, but they can also be omitted.
Then, as with the multiplication of binary numbers without binary points, the row for the solution and the row for the carryovers are calculated. When doing this, the binary points are not taken into account.
The binary point is placed in the solution so that the solution has as many places behind the binary point as the two factors together.
[](https://numeral-systems.com/media/binary_multiply/multiplication_binary_point.webp)
advertisement
## good explanatory videos on Youtube
- [Multiplying binary numbers 1](https://www.youtube.com/watch?v=pMhnNDWh8s0)
- [Multiplying binary numbers 2](https://www.youtube.com/watch?v=0imGQiUunKg)
Share:[Facebook](https://www.facebook.com/sharer/sharer.php?u=https://numeral-systems.com/binary-multiply/)[Twitter](https://twitter.com/intent/tweet?url=https://numeral-systems.com/binary-multiply/&text=)
[Privacy](https://numeral-systems.com/privacy/)[Legal Notice](https://numeral-systems.com/impressum/)[zahlensysteme-rechner.de](https://zahlensysteme-rechner.de/binaer-multiplizieren/) | ||||||||||||||||||
| Readable Markdown | ## Multiplying binary numbers
2 binary numbers are multiplied in the same way as 2 decimal numbers are multiplied. First, the two binary numbers to be multiplied are written down.
[](https://numeral-systems.com/media/binary_multiply/task.webp)
All digits of the second number are then multiplied by the first number and written underneath each other so that the number is shifted to the left by as many digits as there are places after the current digit in the second number. For better clarity, the empty spaces to the right of the numbers can be marked with an āxā or a dot. However, this is not necessary. If the current digit is a 0 and the product is therefore 0, then often as many zeros are written down as the first number has digits instead of just one 0.
[](https://numeral-systems.com/media/binary_multiply/calculation.webp)
It doesn't matter whether you start with the first or the last digit of the second number.
[](https://numeral-systems.com/media/binary_multiply/calculation_reverse.webp)
Then, starting from the right, for each column the sum of the numbers in this column is calculated. If the sum of a column is 0 or 1, it is written in the row for the solution.
[](https://numeral-systems.com/media/binary_multiply/binary_multiply.webp)
### Carryovers:
If the sum of the numbers in a column is greater than 1, then the last digit of the sum converted into a binary number is written in the row for the solution, and what comes before the last digit is written in the row for the carryovers one column to the left. The carryovers can be written down as binary numbers. However, when adding up the next column, it must be taken into account that the number in the row for the carryover is a binary number. It is simpler and more compact if the carryovers are written down as decimal numbers.
For example, if the sum of the numbers in a column is 3, the number is first converted into a binary number. This results in 112. The back 1 is written in the row for the solution and the front 1 in the row for the carryovers.
If the sum of the numbers in a column is 10, this results in 10102 when converted into a binary number. The trailing 0 is written in the row for the solution and 1012 is converted into a decimal number. This results in 5. And this 5 is written in the row for the carryovers one column to the left.
#### Example:
As an example, 11112 ā 1112 is to be calculated.
In the last column there is only one 1, so the 1 is written in the row for the solution.
[](https://numeral-systems.com/media/binary_multiply/carryover1.webp)
The sum of the numbers in the second last row is 2. Converted into a binary number, this is 102. The 0 is written in the row for the solution and the 1 in the row for the carryovers one column to the left.
[](https://numeral-systems.com/media/binary_multiply/carryover2.webp)
In the next column, the sum of the numbers is 4, which is 1002 in the binary system. The 0 is written in the row for the solution and because 102 is 2 in the decimal system, a 2 is written in the row for the carryovers.
[](https://numeral-systems.com/media/binary_multiply/carryover3.webp)
In the fourth column from the right, the sum is 5, which corresponds to 1012. So a 1 is written in the row for the solutions and a 2 in the row for the carryovers.
[](https://numeral-systems.com/media/binary_multiply/carryover4.webp)
In the next column, the sum is again 4 and therefore a 0 is written in the row for the solution and the carry is 2.
[](https://numeral-systems.com/media/binary_multiply/carryover5.webp)
Then the sum is 3, which corresponds to 112. So a 1 is written in both the row for the solution and the row for the carryovers.
[](https://numeral-systems.com/media/binary_multiply/carryover6.webp)
[](https://numeral-systems.com/media/binary_multiply/carryover7.webp)
#### alternative calculation of the carryovers:
The sum of a column does not have to be converted into a binary number to determine the carryover and the number that is written in the row for the solution. Instead, the sum can also be divided by 2. If the sum is divisible by 2, then a 0 is written in the row for the solution, otherwise a 1. To determine the carryover, the sum is divided by 2 and rounded down.
For example, if the sum of the numbers in a column is 5, then a 1 is written in the row for the solutions because 5 is not divisible by 2. To calculate the carryover, 5 is divided by 2. This results in 2.5 and if you round the 2.5 down, you get 2.
### Numbers with binary points:
If at least one of the two factors is a number with a binary point, each digit of the second number is multiplied by the first number in the same way as for binary numbers without a binary point. The binary points of the first number can be included, but they can also be omitted.
Then, as with the multiplication of binary numbers without binary points, the row for the solution and the row for the carryovers are calculated. When doing this, the binary points are not taken into account.
The binary point is placed in the solution so that the solution has as many places behind the binary point as the two factors together.
[](https://numeral-systems.com/media/binary_multiply/multiplication_binary_point.webp) | ||||||||||||||||||
| ML Classification | |||||||||||||||||||
| ML Categories |
Raw JSON{
"/Computers_and_Electronics": 722,
"/Computers_and_Electronics/Software": 534,
"/Computers_and_Electronics/Software/Software_Utilities": 500,
"/Reference": 121,
"/Reference/Technical_Reference": 113,
"/Science": 102
} | ||||||||||||||||||
| ML Page Types |
Raw JSON{
"/Interactive_Tools": 970,
"/Interactive_Tools/Calculator": 964
} | ||||||||||||||||||
| ML Intent Types |
Raw JSON{
"Informational": 808,
"Transactional": 260,
"Commercial": 117
} | ||||||||||||||||||
| Content Metadata | |||||||||||||||||||
| Language | en | ||||||||||||||||||
| Author | null | ||||||||||||||||||
| Publish Time | not set | ||||||||||||||||||
| Original Publish Time | 2024-05-19 22:01:55 (1 year ago) | ||||||||||||||||||
| Republished | No | ||||||||||||||||||
| Word Count (Total) | 1,057 | ||||||||||||||||||
| Word Count (Content) | 871 | ||||||||||||||||||
| Links | |||||||||||||||||||
| External Links | 3 | ||||||||||||||||||
| Internal Links | 29 | ||||||||||||||||||
| Technical SEO | |||||||||||||||||||
| Meta Nofollow | No | ||||||||||||||||||
| Meta Noarchive | No | ||||||||||||||||||
| JS Rendered | No | ||||||||||||||||||
| Redirect Target | null | ||||||||||||||||||
| Performance | |||||||||||||||||||
| Download Time (ms) | 173 | ||||||||||||||||||
| TTFB (ms) | 172 | ||||||||||||||||||
| Download Size (bytes) | 3,946 | ||||||||||||||||||
| Shard | 8 (laksa) | ||||||||||||||||||
| Root Hash | 12507034100077953008 | ||||||||||||||||||
| Unparsed URL | com,numeral-systems!/binary-multiply/ s443 | ||||||||||||||||||