免费二进制运算计算器
进行二进制数的加减乘除和逻辑运算。
Sum Val
57
公式
## Binary Arithmetic ### Bitwise Operations - **AND**: both bits must be 1 → result is 1 - **OR**: at least one bit must be 1 → result is 1 - **XOR**: exactly one bit must be 1 → result is 1 ### Example: 42 AND 15 - 42 in binary: 101010 - 15 in binary: 001111 - AND result: 001010 = 10 Bitwise operations work on individual bits of the binary representation.
计算示例
Binary operations on 42 and 15.
- 0142 + 15 = 57
- 0242 - 15 = 27
- 0342 AND 15: 101010 AND 001111 = 001010 = 10
- 0442 OR 15: 101010 OR 001111 = 101111 = 47
- 0542 XOR 15: 101010 XOR 001111 = 100101 = 37
常见问题
What are bitwise operations?
Bitwise operations work on individual bits of binary numbers. AND, OR, and XOR compare corresponding bits of two numbers.
Where are bitwise operations used?
In programming for flags/permissions, network subnet masks, graphics, encryption, and low-level hardware communication.
What is XOR?
XOR (exclusive or) returns 1 when the bits are different and 0 when they are the same. It is used in encryption and error detection.
学习