Modulo Calculator

What is the division remainder?

In Euclidean division, dividend = divisor × quotient + remainder, where 0 ≤ remainder < divisor. In programming, the operator that calculates the remainder is modulo (%). Example: 17 ÷ 5 = quotient 3, remainder 2.

Widely used to check parity (even/odd), cycles, hashes and cryptographic algorithms.