About the Modular Arithmetic Calculator
Modular arithmetic works with remainders: a mod n is the remainder when a is divided by n. Clocks use mod 12 and weekdays mod 7.
Calculate the remainder of an integer after division by a positive modulus.
Log in or create a free account to save your inputs and results, so you don't have to enter them again next time.🔒 No spam, ever. We never sell or share your details, and you can delete your history or account at any time. Privacy policy
Fill in the details and click Calculate to see your results.

Modular arithmetic works with remainders: a mod n is the remainder when a is divided by n. Clocks use mod 12 and weekdays mod 7.
| Number | 123 |
| Modulus | 10 |
| 123 mod 10 | 3 |
| Quotient | 12 |
| Check | 123 = 10 × 12 + 3 |
| Remainder in C, Java, JavaScript (a % m) | 3 |
3.
| Number | 100 |
| Modulus | 7 |
| 100 mod 7 | 2 |
| Quotient | 14 |
| Check | 100 = 7 × 14 + 2 |
| Remainder in C, Java, JavaScript (a % m) | 2 |
2.
3.
Clocks, calendars, check digits (ISBN, Aadhaar), hashing and cryptography.