AND Calculator – Logical & Bitwise AND
Compute logical AND and bitwise AND for up to 4 inputs — see truth tables, bit-by-bit visualization, binary/hex output, and Boolean algebra laws.
Prime numbers, GCD, LCM, and divisibility calculators. Browse our free number theory tools below — no sign-up required.
Compute logical AND and bitwise AND for up to 4 inputs — see truth tables, bit-by-bit visualization, binary/hex output, and Boolean algebra laws.
Convert decimal numbers to Babylonian base-60 (sexagesimal) notation with cuneiform symbols, positional breakdown, and conversion tables showing the legacy of base-60 in modern time and angles.
Perform left shift, logical right shift, and arithmetic right shift with bit-by-bit visualization, shift tables, sign extension, and multiply/divide equivalences.
Perform all bitwise operations (AND, OR, XOR, NOT, NAND, NOR, XNOR, shifts) on two numbers with step-by-step binary breakdown, bit grid visualization, and operations comparison table.
Solve systems of 2 or 3 congruences with the Chinese Remainder Theorem. Normalize residues, merge non-coprime systems, verify every modulus, and list the full solution family.
Calculate chord length, arc length, sagitta, segment area, and sector area from radius and central angle, with circle diagram, reference table, and visual comparison bars.
Explore the Collatz conjecture (3n+1 problem) for any starting number. See total steps, max value, stopping time, full sequence table, step chart visual, and preset examples.
Find the common denominator for two or more fractions, convert to equivalent fractions, compare values, and see step-by-step LCD solutions with visual fraction bars.
Perform operations on complex numbers in a+bi form — add, subtract, multiply, divide, conjugate, modulus, and argument with an interactive Argand diagram.
Convert complex numbers between rectangular (a+bi), polar (r∠θ), Euler (re^iθ), and trigonometric forms with step-by-step conversion and a unit-circle diagram.
Plot points on a coordinate grid, calculate distances, midpoints, slopes, areas, and identify quadrants. Includes SVG grid display, pairwise distance table, and presets.
Find corner points of a feasible region from a system of linear inequalities, evaluate an objective function at each vertex, and identify the optimal solution for linear programming problems.
Convert between cylindrical (r, θ, z) and Cartesian (x, y, z) coordinates with step-by-step solutions, reference angle table, and top-down projection visual.
Test divisibility of any number by 2–12 and custom divisors. See rules, digit sum method, remainder, comprehensive rules table, visual divisibility grid, and presets.
Find all divisors of a number, count them (τ), sum them (σ), classify as perfect/abundant/deficient, visualize factor pairs, and explore presets with a comprehensive divisors table.
Compute GCD via the Euclidean algorithm with step-by-step division, extended Euclidean algorithm, Bézout coefficients, LCM, presets, steps table, and visual representation.
Write any number in expanded form, factored form, scientific notation, and word form with place value breakdown tables, visual blocks, and reference charts.
Verify Fermat's little theorem, compute a^(p-1) mod p, perform modular exponentiation, check primality, view computation steps, and explore theorem properties with presets.
Compute the nth Fibonacci number, generate a sequence of terms, explore golden ratio convergence, Binet's formula, presets, sequence table, and ratio convergence visual.
Find the GCD of fraction denominators, simplify fractions, explore prime factorizations, and visualize the relationship between GCD and LCD with step-by-step solutions.
Calculate the GCD using the Euclidean algorithm and prime factorization. See Bézout identity, coprimality check, factor Venn diagram, and step-by-step solutions.
Calculate the LCD for fractions using prime factorization or listing multiples. Convert fractions, compare visually, and see step-by-step solutions with factor tables.
Find the lowest common denominator, add or subtract fractions, compare with visual fraction strips, and follow step-by-step solutions for any pair of fractions.
Compute logical NOR and bitwise NOR, see truth tables, universal gate proofs (build AND/OR/NOT from NOR), bit-by-bit visualization, and multi-input NOR.
Compute inclusive OR and exclusive OR (XOR) for up to 4 inputs — see truth tables, bit-by-bit visualization, binary/hex output, and Boolean algebra laws.
Convert between point-slope, slope-intercept, and standard form. Find the equation of a line from two points, parallel lines, and perpendicular lines with visual plots and comparison tables.
Multiply, divide, raise to powers, and extract roots of complex numbers in polar form using De Moivre's theorem with an interactive polar plot.
Analyze queueing systems with M/M/1, M/M/c, and M/M/1/K models. Calculate utilization, average queue length, wait time, system time, probability of empty system, and more. Includes preset...
Check if two or more numbers are relatively prime (coprime), see Euclidean algorithm steps, prime factorizations, totient values, and coprimality grids.
Convert between spherical (ρ, θ, φ), Cartesian (x, y, z), and cylindrical (r, θ, z) coordinates with step-by-step solutions, convention toggle, and projection diagrams.
Compute the tensor (Kronecker) product of two matrices with step-by-step block decomposition, heatmap visualization, dimension analysis, and property verification table.
Generate truth tables for logical expressions with up to 4 variables — AND, OR, NOT, XOR, NAND, NOR, IMPLIES, and XNOR — with tautology/contradiction detection and a visual result grid.
Explore the Ugly Duckling Theorem with binary feature vectors. Compare objects using Hamming distance, shared features, Jaccard similarity, and matching coefficients. Includes preset examples, feat...
Compute logical XOR and bitwise XOR for up to 4 inputs — see truth tables, parity checks, bit-by-bit visualization, binary/hex output, and swap tricks.