âšī¸ 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://www.geeksforgeeks.org/maths/binary-multiplication/ |
| Last Crawled | 2026-04-08 12:54:43 (2 days ago) |
| First Indexed | 2025-06-25 23:45:29 (9 months ago) |
| HTTP Status Code | 200 |
| Meta Title | Binary Multiplication - GeeksforGeeks |
| Meta Description | Your All-in-One Learning Portal: GeeksforGeeks is a comprehensive educational platform that empowers learners across domains-spanning computer science and programming, school education, upskilling, commerce, software tools, competitive exams, and more., Your All-in-One Learning Portal. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions. |
| Meta Canonical | null |
| Boilerpipe Text | null |
| Markdown | [](https://www.geeksforgeeks.org/)
- Courses
- Tutorials
- Interview Prep
- [Number System and Arithmetic](https://www.geeksforgeeks.org/engineering-mathematics/number-theory/)
- [Algebra](https://www.geeksforgeeks.org/maths/algebra/)
- [Set Theory](https://www.geeksforgeeks.org/maths/set-theory/)
- [Probability](https://www.geeksforgeeks.org/maths/probability-in-maths/)
- [Statistics](https://www.geeksforgeeks.org/maths/statistics/)
- [Geometry](https://www.geeksforgeeks.org/maths/geometry/)
- [Calculus](https://www.geeksforgeeks.org/maths/math-calculus/)
- [Logarithms](https://www.geeksforgeeks.org/maths/logarithms/)
- [Mensuration](https://www.geeksforgeeks.org/maths/mensuration/)
- [Matrices](https://www.geeksforgeeks.org/engineering-mathematics/matrices/)
- [Trigonometry](https://www.geeksforgeeks.org/maths/math-trigonometry/)
- [Mathematics](https://www.geeksforgeeks.org/maths/maths/)
# Binary Multiplication
Last Updated : 23 Jul, 2025
****Binary Multiplication**** is a mathematical operation that involves multiplying two binary numbers, which are numbers composed of only 0s and 1s. Binary multiplication is similar to decimal multiplication, except that the base of the number system is 2 instead of 10.
- Binary multiplication involves multiplying each bit of the first number by each bit of the second number, and then adding the results.
- Binary multiplication is fundamental in computer science and digital systems, as binary is the foundational numeral system for representing information in computers.

Binary Multiplication
In this article, we will learn about Binary Numbers, Binary multiplication, and the rules to perform Binary multiplication, accompanied by solved examples.
### ****What are Binary Numbers?****
Binary Number is a number that is used to represent various numbers using only two symbols, â0â and â1â.
- Binary numbers are expressed in the base-2 numeral system.
- Each digit in this system is called a bit.
> ****Example of a Binary Number:**** Binary of Equivalent of 6 = (110)2
****Learn More,**** [****Binary Number System****](https://www.geeksforgeeks.org/maths/binary-number-system/)
## Binary Multiplication Rules
Binary Multiplication is performed in the same manner as decimal numbers are multiplied. However, there are some specific rules regarding the multiplication among the binary digits 0 and 1, which we need to follow while performing the division of Binary Multiplication. Binary Multiplication rules are shown in the Binary Multiplication Table below:
### Binary Multiplication Table
The rules for Binary Multiplication are tabulated below:
| Table for Binary Multiplication Rule | |
|---|---|
| Rules for Multiplication | Meaning |
| 0 Ã 0 = 0 | If 0 (zero) is multiplied by another 0 (zero), then the result is 0 (zero). |
| 0 Ã 1 = 0 | If 0 (zero) is multiplied by 1 (one), then the result is 0 (zero). |
| 1 Ã 0 = 0 | If 1 (one) is multiplied by 0 (zero), then the result is 0 (zero). |
| 1 Ã 1 = 1 | If 1 (one) is multiplied by another 1 (one), then the result is 1 (one). |
## Binary Multiplication Calculator
The binary multiplication calculator added below can easily multiply two binary numbers.
## How to do Binary Multiplication?
There are five key steps involved in Binary Multiplication:,
****Step 1:**** Write the multiplicand and the multiplier one below the other, aligning the rightmost digits.
****Step 2:**** Multiply the multiplicand by each digit of the multiplier, starting from the rightmost digit.
****Step 3:**** Move to the next digit of the multiplier and multiply it by the multiplicand. Write the result below the multiplier after shifting it to the left by one position.
****Step 4:**** Repeat this process for each digit of the multiplier, shifting the result to the left by one more position each time.
****Step 5:**** Add all the results using binary addition rules. The final sum is the product of the two binary numbers.
You can also use the Binary Multiplication Calculator to easily calculate the multiplication of two binary numbers.
## Solved Question on Binary Multiplication
****Question 1:**** (1010)2 Ã (101)2
****Solution:****
> ****Step 1:**** Write the multiplicand (1010)2 and the multiplier (101)2 one below the other, aligning the rightmost digits.
> ****Step 2:**** Multiply the multiplicand by each digit of the multiplier, starting from the rightmost digit. The rightmost digit of the multiplier is 1, so we write down the multiplicand as it is.
> ****Step 3:**** Move to the next digit of the multiplier and multiply it by the multiplicand. The next digit of the multiplier is 0, so we write down 0 after shifting it to the left by one position.
> ****Step 4:**** Move to the next digit of the multiplier and multiply it by the multiplicand. The next digit of the multiplier is 1, so we write down the multiplicand after shifting it to the left by two positions.
> ****Step 5:**** Add all the results using binary addition rules. The final sum (110010)2 is the product of the two binary numbers.
>
> 
>
> So, the product of (1010)2 Ã (101)2 is (110010)2
****Question 2:**** (1101)2 Ã (100)2
****Solution:****
> ****Step 1:**** Write the multiplicand (1101)2 and the multiplier (100)2 one below the other, aligning the rightmost digits.
> ****Step 2:**** Multiply the multiplicand by each digit of the multiplier, starting from the rightmost digit. The rightmost digit of the multiplier is 0, so we write down 0.
> ****Step 3:**** Move to the next digit of the multiplier and multiply it by the multiplicand. The next digit of the multiplier is 0, so we write down 0 after shifting it to the left by one position.
> ****Step 4:**** Move to the next digit of the multiplier and multiply it by the multiplicand. The next digit of the multiplier is 1, so we write down the multiplicand after shifting it to the left by two positions.
> ****Step 5:**** Add all the results using binary addition rules. The final sum (110100)2 is the product of the two binary numbers.
>
> 
>
> So, the product of (1101)2 Ã (100)2 is (110100)2
****Question 3:**** (0.101)2 Ã (0.11)2
****Solution:****
> ****Step 1:**** Write the multiplicand (0.101)2 and the multiplier (0.11)2 one below the other, aligning the rightmost digits.
> ****Step 2:**** Multiply the multiplicand by each digit of the multiplier, starting from the rightmost digit. The rightmost digit of the multiplier is 1, so we write down the multiplicand as it is.
> ****Step 3:**** Move to the next digit of the multiplier and multiply it by the multiplicand. The next digit of the multiplier is 1, so we write down the multiplicand after shifting it to the left by one position.
> ****Step 4:**** Move to the next digit of the multiplier and multiply it by the multiplicand. The next digit of the multiplier is 0, so we write down 0 after shifting it to the left by two positions.
> ****Step 5:**** Add all the results using binary addition rules. The final sum (001111)2 is the product of the two binary numbers.
> ****Step 6:**** Count the total number of digits (d) after the decimal point in both the multiplicands and the multiplier. Place the decimal point in the product after (d) digits from right side.
>
> 
>
> So, the product of (0.101)2 Ã (0.11)2 is (0.01111)2
****Question 4:**** (101.01)2 Ã (110)2
****Solution:****
> ****Step 1:**** Write the multiplicand (101.01)2 and the multiplier (110)2 one below the other, aligning the rightmost digits.
>
> ****Step 2:**** Multiply the multiplicand by each digit of the multiplier, starting from the rightmost digit. The rightmost digit of the multiplier is 0, so we write down 0.
>
> ****Step 3:**** Move to the next digit of the multiplier and multiply it by the multiplicand. The next digit of the multiplier is 1, so we write down the multiplicand after shifting it to the left by one position.
>
> ****Step 4:**** Move to the next digit of the multiplier and multiply it by the multiplicand. The next digit of the multiplier is 1, so we write down the multiplicand after shifting it to the left by two positions.
>
> ****Step 5:**** Add all the results using binary addition rules. The final sum (1111110)2 is the product of the two binary numbers.
>
> ****Step 6:**** Count the total number of digits (d) after the decimal point in both the multiplicands and the multiplier. Place the decimal point in the product after (d) digits from right side.
>
> 
>
> So, product of (101.01)2 Ã (110)2 is (11111.10)2
****Question 5:**** (1111)2 Ã (1010)2
****Solution:****
> ****Step 1:**** Write the multiplicand (1111)2 and the multiplier (1010)2 one below the other, aligning the rightmost digits.
>
> ****Step 2:**** Multiply the multiplicand by each digit of the multiplier, starting from the rightmost digit. The rightmost digit of the multiplier is 0, so we write down 0.
>
> ****Step 3:**** Move to the next digit of the multiplier and multiply it by the multiplicand. The next digit of the multiplier is 1, so we write down the multiplicand after shifting it to the left by one position.
>
> ****Step 4:**** Move to the next digit of the multiplier and multiply it by the multiplicand. The next digit of the multiplier is 0, so we write down 0 after shifting it to the left by two positions.
>
> ****Step 5:**** Move to the next digit of the multiplier and multiply it by the multiplicand. The next digit of the multiplier is 1, so we write down the multiplicand after shifting it to the left by three positions.
>
> ****Step 6:**** Add all the results using binary addition rules. The final sum (10010110)2 is the product of the two binary numbers.
>
> 
>
> So, the product of (1111)2 Ã (1010)2 is (10010110)2
****Also, check the**** [****Binary Formula****](https://www.geeksforgeeks.org/maths/binary-formula/)
## Binary Multiplication Practice Questions
Some questions on Binary Multiplications are,
****Question 1:**** Multiply (1110)2 by (10)2
****Question 2:**** Multiply(10010101)2 by (11)2
****Question 3:**** Multiply (1001)2 by (1001)2
****Question 4:**** Multiply (1110010)2 by (111)2
****Question 5:**** Multiply (110.10)2 by (101)2
Comment
Article Tags:
Article Tags:
[Mathematics](https://www.geeksforgeeks.org/category/school-learning/maths/)
[School Learning](https://www.geeksforgeeks.org/category/school-learning/)
[Geeks Premier League](https://www.geeksforgeeks.org/category/geeksforgeeks-initiatives/geeks-premier-league/)
[Math-Concepts](https://www.geeksforgeeks.org/tag/math-concepts/)
[Geeks Premier League 2023](https://www.geeksforgeeks.org/tag/geeks-premier-league-2023/)
[\+1 More]()
### Explore
[](https://www.geeksforgeeks.org/)

Corporate & Communications Address:
A-143, 7th Floor, Sovereign Corporate Tower, Sector- 136, Noida, Uttar Pradesh (201305)

Registered Address:
K 061, Tower K, Gulshan Vivante Apartment, Sector 137, Noida, Gautam Buddh Nagar, Uttar Pradesh, 201305
[](https://geeksforgeeksapp.page.link/gfg-app)[](https://geeksforgeeksapp.page.link/gfg-app)
- Company
- [About Us](https://www.geeksforgeeks.org/about/)
- [Legal](https://www.geeksforgeeks.org/legal/)
- [Privacy Policy](https://www.geeksforgeeks.org/legal/privacy-policy/)
- [Contact Us](https://www.geeksforgeeks.org/about/contact-us/)
- [Advertise with us](https://www.geeksforgeeks.org/advertise-with-us/)
- [GFG Corporate Solution](https://www.geeksforgeeks.org/gfg-corporate-solution/)
- [Campus Training Program](https://www.geeksforgeeks.org/campus-training-program/)
- Explore
- [POTD](https://www.geeksforgeeks.org/problem-of-the-day)
- [Job-A-Thon](https://practice.geeksforgeeks.org/events/rec/job-a-thon/)
- [Blogs](https://www.geeksforgeeks.org/category/blogs/?type=recent)
- [Nation Skill Up](https://www.geeksforgeeks.org/nation-skill-up/)
- Tutorials
- [Programming Languages](https://www.geeksforgeeks.org/computer-science-fundamentals/programming-language-tutorials/)
- [DSA](https://www.geeksforgeeks.org/dsa/dsa-tutorial-learn-data-structures-and-algorithms/)
- [Web Technology](https://www.geeksforgeeks.org/web-tech/web-technology/)
- [AI, ML & Data Science](https://www.geeksforgeeks.org/machine-learning/ai-ml-and-data-science-tutorial-learn-ai-ml-and-data-science/)
- [DevOps](https://www.geeksforgeeks.org/devops/devops-tutorial/)
- [CS Core Subjects](https://www.geeksforgeeks.org/gate/gate-exam-tutorial/)
- [Interview Preparation](https://www.geeksforgeeks.org/aptitude/interview-corner/)
- [Software and Tools](https://www.geeksforgeeks.org/websites-apps/software-and-tools-a-to-z-list/)
- Courses
- [ML and Data Science](https://www.geeksforgeeks.org/courses/category/machine-learning-data-science)
- [DSA and Placements](https://www.geeksforgeeks.org/courses/category/dsa-placements)
- [Web Development](https://www.geeksforgeeks.org/courses/category/development-testing)
- [Programming Languages](https://www.geeksforgeeks.org/courses/category/programming-languages)
- [DevOps & Cloud](https://www.geeksforgeeks.org/courses/category/cloud-devops)
- [GATE](https://www.geeksforgeeks.org/courses/category/gate)
- [Trending Technologies](https://www.geeksforgeeks.org/courses/category/trending-technologies/)
- Videos
- [DSA](https://www.geeksforgeeks.org/videos/category/sde-sheet/)
- [Python](https://www.geeksforgeeks.org/videos/category/python/)
- [Java](https://www.geeksforgeeks.org/videos/category/java-w6y5f4/)
- [C++](https://www.geeksforgeeks.org/videos/category/c/)
- [Web Development](https://www.geeksforgeeks.org/videos/category/web-development/)
- [Data Science](https://www.geeksforgeeks.org/videos/category/data-science/)
- [CS Subjects](https://www.geeksforgeeks.org/videos/category/cs-subjects/)
- Preparation Corner
- [Interview Corner](https://www.geeksforgeeks.org/interview-prep/interview-corner/)
- [Aptitude](https://www.geeksforgeeks.org/aptitude/aptitude-questions-and-answers/)
- [Puzzles](https://www.geeksforgeeks.org/aptitude/puzzles/)
- [GfG 160](https://www.geeksforgeeks.org/courses/gfg-160-series)
- [System Design](https://www.geeksforgeeks.org/system-design/system-design-tutorial/)
[@GeeksforGeeks, Sanchhaya Education Private Limited](https://www.geeksforgeeks.org/), [All rights reserved](https://www.geeksforgeeks.org/copyright-information/) |
| Readable Markdown | null |
| Shard | 103 (laksa) |
| Root Hash | 12046344915360636903 |
| Unparsed URL | org,geeksforgeeks!www,/maths/binary-multiplication/ s443 |