Skip to content
Allin
Sign up · Sign in

Bitwise Calculator

AND, OR, XOR, NOT and shifts in binary, decimal or hex, at 8, 16, 32 or 64 bits, with the bit-by-bit diagram and the result in all three bases. Computed with BigInt, so the 64-bit answers are right where JavaScript's own 32-bit operators would silently truncate.

Related tools

All Discrete maths & graphs tools →
Karnaugh Map (K-Map) SolverMinimize a boolean function with the Quine–McCluskey algorithm: enter minterms, maxterms or a truth table and get the minimal SOP or POS, prime implicants and literal count.Logic Gate SimulatorDraws the gate diagram for a boolean expression and lets you flip each input to watch the signal travel through. Half-adder, multiplexer, parity and majority circuits are one click away.Traveling Salesman SolverSolve the Traveling Salesman Problem from coordinates or a distance matrix: exact Held–Karp for up to 12 cities, nearest-neighbor + 2-opt beyond, with the tour order, total distance and a plot.Truth Table GeneratorBuilds the full truth table for up to 8 variables, with a column per sub-expression so you can see where a row turns. Classifies the formula as tautology, contradiction or contingency, lists the minterms and maxterms, and copies out as CSV, LaTeX or Markdown.Delaunay triangulation generatorPaste a set of 2D points and it triangulates them the Delaunay way — the triangulation that avoids thin sliver triangles, where no point lies inside another triangle's circumcircle. It runs the Bowyer-Watson algorithm in your browser and draws the mesh, with point, triangle and edge counts.Dijkstra shortest path calculatorEnter a weighted graph as edges ("A, B, 4" per line) and a source node: Dijkstra's algorithm returns the shortest distance and the exact path from the source to every reachable vertex. Works for directed or undirected graphs, accepts many edge formats, and flags unreachable vertices — ideal for routing, networks and pathfinding.Graph coloring calculatorColor a graph so that no two adjacent vertices share a color. Enter an edge list and the DSATUR (or greedy) heuristic assigns a color to every vertex, shows the color classes, and reports an upper bound on the chromatic number χ. K4 needs 4 colors, an even cycle 2, an odd cycle 3 — see it instantly.Shannon entropy calculatorPaste a probability distribution and get its Shannon entropy H = −Σ p·log p in bits — the average information per outcome. It also shows the maximum possible entropy (a uniform distribution) and the redundancy, how far below that maximum you are.

Open Bitwise Calculator and you get an answer straight away, with no account to create. Its place is under Discrete maths & graphs; Karnaugh Map (K-Map) Solver and Logic Gate Simulator answer the questions closest to this one.

How to use it

  1. Open the tool — no signup or install needed.
  2. Enter your input or adjust the available options.
  3. Get your result instantly, then copy or download it.

Frequently asked questions

What is Bitwise Calculator?

AND, OR, XOR, NOT and shifts in binary, decimal or hex, at 8, 16, 32 or 64 bits, with the bit-by-bit diagram and the result in all three bases. Computed with BigInt, so the 64-bit answers are right where JavaScript's own 32-bit operators would silently truncate.

When would I actually use this?

Anything modelled as points and connections: a shortest route, a network's capacity, a schedule with dependencies, or a circuit reduced to its logic.

What is the most common mistake?

Assuming a shortest path stays shortest when a weight changes sign. Negative edges break the greedy argument Dijkstra rests on, and the algorithm returns a confident wrong answer rather than an error.

Is there a tool for the next step?

Logic Gate Simulator is the closest one after this: Draws the gate diagram for a boolean expression and lets you flip each input to watch the signal travel through. Half-adder, multiplexer, parity and majority circuits are one click away.

What else is worth having open alongside it?

Traveling Salesman Solver and Truth Table Generator — they come up in the same task often enough to be worth a second tab.

Where do the figures come from?

The algorithms are the textbook ones and their results are exact for the graph you enter. What varies is cost: several of these problems have no known efficient solution, so large inputs are answered by heuristic and the tool says when that is the case.

Further reading

All guides →
ExplainerPassword Entropy: What a Strength Meter Cannot KnowEntropy measures the process that produced a password, not the characters in it. H = L x log2(R) is only true when every character was chosen at random — which is exactly why a meter scoring a human-invented password on its character classes is measuring the wrong thing.ExplainerThe Flat Pattern of a Cone Is a Sector, Not a CircleRoll a 50 mm cone 80 mm tall and its pattern is a 190.8° slice of a 94 mm circle. Flatten a nearly cylindrical lampshade and the pattern radius runs to 839 mm — the shallower the taper, the further away the apex.ExplainerA 1 % Drop Rate Does Not Mean One Hundred RunsAt 1 %, a hundred attempts give you 63.4 % — not certainty. Ninety per cent takes 230 attempts and ninety-nine takes 459, and more than a third of players are still empty-handed at a hundred.ExplainerFibonacci and the Golden RatioThe Fibonacci sequence adds each pair of terms to make the next; the ratio of neighboring terms homes in on the golden ratio φ ≈ 1.618. See how, and where the pattern turns up.ExplainerWhat Is a Z-Score? Standard Deviations Above the MeanA z-score is z = (x − μ) / σ — how many standard deviations a value sits from the mean. Learn how to compute it, read the standard normal curve, and turn it into a percentile.How-toHow to Find the Distance Between Two PointsUse the distance formula d = √((x₂−x₁)² + (y₂−y₁)²) to measure the straight-line distance between two points on a plane, with a worked example and the midpoint too.