Skip to content

Best Calculator Hub

Divisibility Calculator

Check a number's divisibility by integers 1-20, find all divisors, and determine if it's a prime number.

Enter a Number

Quick Reference

A number is divisible by another if there is no remainder when dividing.

Example: 24 is divisible by 2, 3, 4, 6, 8, and 12 because:

  • 24 ÷ 2 = 12 (no remainder)
  • 24 ÷ 3 = 8 (no remainder)
  • 24 ÷ 4 = 6 (no remainder)
  • 24 ÷ 6 = 4 (no remainder)
  • 24 ÷ 8 = 3 (no remainder)
  • 24 ÷ 12 = 2 (no remainder)

Finding all divisors gives you every number that divides evenly into your number.

Prime numbers are only divisible by 1 and themselves.

Divisibility Results for 24

Divisor Divisible? Calculation

All Divisors

These are all the numbers that divide evenly into 24:

Common Divisibility Rules

Divisibility by 2

A number is divisible by 2 if its last digit is even (0, 2, 4, 6, or 8).

Divisibility by 3

A number is divisible by 3 if the sum of its digits is divisible by 3.

Divisibility by 4

A number is divisible by 4 if the last two digits form a number divisible by 4.

Divisibility by 5

A number is divisible by 5 if its last digit is 0 or 5.

Divisibility by 6

A number is divisible by 6 if it is divisible by both 2 and 3.

Divisibility by 9

A number is divisible by 9 if the sum of its digits is divisible by 9.

Divisibility by 10

A number is divisible by 10 if its last digit is 0.

Divisibility by 11

Alternately add and subtract the digits. If the result is divisible by 11, so is the number.

What is Divisibility?
Finding Divisors
Prime Numbers
Applications

What is Divisibility?

Divisibility is a mathematical concept that determines whether one number can be divided by another without leaving a remainder. If number A is divisible by number B, then A ÷ B yields a whole number with no remainder.

In mathematical notation, we say "A is divisible by B" if and only if there exists an integer k such that A = B × k. This is also written as "B divides A" or "B | A".

For example, 12 is divisible by 3 because 12 ÷ 3 = 4 (a whole number with no remainder). However, 14 is not divisible by 3 because 14 ÷ 3 = 4 remainder 2.

Divisibility is a fundamental concept in number theory and has numerous applications in mathematics, computer science, and everyday problem-solving.

Finding All Divisors of a Number

The divisors (or factors) of a number are all the integers that divide the number evenly (with no remainder). Every positive integer has at least two divisors: 1 and itself.

For example, the divisors of 24 are: 1, 2, 3, 4, 6, 8, 12, and 24.

Finding all divisors can be done efficiently by checking potential divisors up to the square root of the number, and then including their corresponding quotients:

  1. Check each integer from 1 up to the square root of the number.
  2. If the integer divides the number evenly, it is a divisor.
  3. For each such divisor d, the quotient (number ÷ d) is also a divisor.

The sum of all divisors and the number of divisors of a given number are important concepts in number theory.

Prime Numbers and Divisibility

A prime number is a natural number greater than 1 that has exactly two divisors: 1 and itself. In other words, a prime number has no positive divisors other than 1 and itself.

Examples of prime numbers include 2, 3, 5, 7, 11, 13, 17, 19, etc.

Prime numbers are the building blocks of all natural numbers, as stated by the Fundamental Theorem of Arithmetic: every natural number greater than 1 can be written as a unique product of prime numbers (up to the order of the factors).

Checking if a number is prime involves determining if it has any divisors other than 1 and itself. Efficient algorithms for primality testing include:

  • Trial division (checking potential divisors up to the square root)
  • Sieve of Eratosthenes (for finding all primes up to a limit)
  • Advanced algorithms like Miller-Rabin for large numbers

Prime numbers have important applications in cryptography, computer science, and various areas of mathematics.

Applications of Divisibility

Divisibility has numerous practical applications in various fields:

  • Mathematics Education: Teaching fundamental arithmetic concepts and number sense
  • Computer Science: Optimization algorithms, data structures, and cryptography
  • Cryptography: RSA encryption relies on the difficulty of finding prime factors of large numbers
  • Scheduling: Determining regular intervals and cycles
  • Financial Planning: Calculating payment schedules and interest
  • Engineering: Dimensional analysis and ensuring compatibility between components
  • Computer Graphics: Creating symmetrical patterns and layouts
  • Calendar Systems: Determining leap years and cyclical events
  • Data Validation: Checksums and error detection algorithms

Understanding divisibility rules also helps with mental math and quick calculations in everyday situations, from shopping to cooking to time management.

Picture of Dr. Evelyn Carter

Dr. Evelyn Carter

Author | Chief Calculations Architect & Multi-Disciplinary Analyst

Table of Contents

Divisibility Calculator: The Key to Understanding Number Properties

Our comprehensive divisibility calculator provides an instant way to check if a number is divisible by integers from 1 to 20, find all its divisors, and determine whether it’s a prime or composite number. This powerful tool simplifies mathematical exploration and helps develop deeper number sense for students, educators, and anyone working with integers.

Thank you for reading this post, don't forget to subscribe!

Why Understanding Divisibility Matters

Divisibility is more than just a mathematical concept—it’s a fundamental property that reveals the structure and relationships between numbers. Grasping divisibility opens doors to understanding everything from basic arithmetic to advanced number theory, with applications spanning multiple disciplines:

Key Benefits of Understanding Divisibility

  • Builds number sense – Develops intuition about how numbers relate to each other
  • Enhances mental math – Speeds calculations through pattern recognition
  • Supports problem-solving – Provides tools for tackling mathematical challenges
  • Serves as gateway knowledge – Forms the foundation for learning more advanced concepts
  • Applies across disciplines – Used in computer science, cryptography, engineering, and finance

While many people learn basic divisibility rules in school (like a number ending in 0 or 5 is divisible by 5), few fully appreciate the elegant mathematical structure that divisibility reveals. Our calculator helps make these patterns visible and intuitive, regardless of mathematical background.

Divisibility Rules: The Hidden Patterns in Numbers

Divisibility rules are fascinating shortcuts that allow us to determine if a number is divisible by another without performing the actual division. These patterns reveal the elegant structure inherent in our number system:

Essential Divisibility Rules

  • Divisible by 2 – Last digit is 0, 2, 4, 6, or 8
  • Divisible by 3 – Sum of all digits is divisible by 3
  • Divisible by 4 – Last two digits form a number divisible by 4
  • Divisible by 5 – Last digit is 0 or 5
  • Divisible by 6 – Divisible by both 2 and 3
  • Divisible by 8 – Last three digits form a number divisible by 8
  • Divisible by 9 – Sum of all digits is divisible by 9
  • Divisible by 10 – Last digit is 0

Advanced Divisibility Rules

  • Divisible by 7 – Take last digit, double it, subtract from rest of number; result divisible by 7 means original number is divisible by 7
  • Divisible by 11 – Alternately add and subtract digits; result divisible by 11 means original number is divisible by 11
  • Divisible by 12 – Divisible by both 3 and 4
  • Divisible by 13 – Take last digit, multiply by 4, add to rest of number; result divisible by 13 means original number is divisible by 13
  • Divisible by 16 – Last four digits form a number divisible by 16
  • Divisible by 17 – Take last digit, multiply by 5, subtract from rest of number; result divisible by a 17 means original number is divisible by 17

These patterns arise from the properties of our base-10 number system and reveal deeper mathematical structures.

Understanding Your Divisibility Calculator Results

Our calculator processes your input and provides three essential pieces of information about any number:

Divisibility Check

What it shows: Whether your number is divisible by integers 1 through 20

How to interpret: The calculator displays “Yes” or “No” for each potential divisor, along with the division calculation showing any remainders. A remainder of zero indicates perfect divisibility.

Why it matters: This quick reference helps identify multiplication and division relationships without manual calculation, revealing patterns and properties of your number.

All Divisors List

What it shows: Every integer that divides evenly into your number

How to interpret: The complete list includes all positive integers that divide your number without a remainder, sorted from smallest to largest.

Why it matters: This list reveals the number’s factor structure, helps with factorization problems, and provides insight into the number’s mathematical properties.

Prime or Composite Status

What it shows: Whether your number is prime or composite

How to interpret: A prime number has exactly two divisors (1 and itself), while a composite number has three or more divisors.

Why it matters: Prime numbers are fundamental building blocks in number theory with applications in cryptography, while composite numbers reveal more complex factor structures.

The graphical representation also helps visualize the relationship between divisors and quotients, making abstract number relationships more concrete and intuitive.

Key Mathematical Concepts Related to Divisibility

Divisibility connects to numerous important concepts in mathematics. Understanding these relationships enhances your number sense and problem-solving abilities:

Factors and Multiples

When a number a divides b (without remainder), a is a factor (or divisor) of b, and b is a multiple of a. For example, 4 is a factor of 12, and 12 is a multiple of 4.

Our calculator helps visualize both the factors of a number and how they relate to their corresponding quotients (when your number is divided by each factor).

Prime and Composite Numbers

A prime number has exactly two distinct divisors: 1 and itself. All other integers greater than 1 are composite, meaning they have additional divisors.

The calculator instantly determines whether your number is prime or composite and shows all its divisors, helping you understand its fundamental structure.

Prime Factorization

Every composite number can be expressed as a unique product of prime numbers. This prime factorization reveals the building blocks that make up the number.

While our calculator doesn’t directly show prime factorization, understanding a number’s divisors is the first step toward determining its prime factors.

Greatest Common Divisor (GCD)

The GCD of two or more numbers is the largest positive integer that divides each of them without a remainder.

By finding the divisors of different numbers using our calculator, you can identify their common divisors and determine the GCD.

Least Common Multiple (LCM)

The LCM of two or more numbers is the smallest positive number that is a multiple of all of them.

Understanding divisibility and factorization helps in finding the LCM, which is essential for operations with fractions and solving many real-world problems.

Number Theory Applications

Divisibility properties form the foundation of modular arithmetic, congruences, and Diophantine equations—advanced topics with applications in cryptography, computer science, and beyond.

Building intuition about divisibility with our calculator provides a strong foundation for exploring these more complex mathematical areas.

Practical Applications of Divisibility

The concept of divisibility extends far beyond classroom mathematics, with practical applications in numerous fields:

Education and Learning

  • Developing number sense and arithmetic skills
  • Understanding factor trees and prime factorization
  • Solving problems involving fractions and ratios
  • Building foundations for algebra and higher mathematics
  • Creating mathematical puzzles and games

Computer Science

  • Optimizing algorithms and data structures
  • Implementing hash functions and checksums
  • Designing efficient sorting and searching methods
  • Creating pseudorandom number generators
  • Performing error detection in digital communications

Cryptography and Security

  • Implementing public-key cryptography systems like RSA
  • Generating large prime numbers for encryption keys
  • Creating secure digital signatures
  • Designing hashing algorithms for password storage
  • Building secure communication protocols

Engineering and Design

  • Designing gear systems and mechanical components
  • Planning layouts with regular spacing and symmetry
  • Creating tessellations and repeating patterns
  • Optimizing resource allocation and scheduling
  • Sampling signals in digital processing systems

Everyday Problem Solving

  • Calculating equal distributions (e.g., sharing items among people)
  • Planning schedules with regular intervals
  • Managing finances and budgeting
  • Cooking and recipe scaling
  • Understanding calendar systems and date calculations

Common Questions About Divisibility

How do you determine if a number is divisible by another?

A number is divisible by another if the division operation yields no remainder. Mathematically, if a ÷ b = c with no remainder, then a is divisible by b. You can check divisibility by performing the division and confirming the remainder is zero, or by using divisibility rules for common divisors. For example, a number is divisible by 2 if its last digit is even (0, 2, 4, 6, or 8). Our calculator automates this process, checking divisibility for numbers 1 through 20 and showing the actual calculations with any remainders. This helps you verify the results and understand the underlying process.

What’s the difference between a factor, divisor, and multiple?

The terms “factor” and “divisor” are essentially synonymous in mathematics: if a number b divides evenly into a number a (with no remainder), then b is both a factor and a divisor of a. A multiple, on the other hand, represents the relationship in the opposite direction. If a is divisible by b, then a is a multiple of b. For example, 6 is divisible by 3, which means 3 is a factor (or divisor) of 6, and 6 is a multiple of 3. Think of factors/divisors as smaller numbers that can be multiplied to make a larger number, while multiples are larger numbers that contain the original number a whole number of times. Our calculator helps you find all the factors/divisors of any positive integer, giving you a complete picture of its divisibility properties.

How are prime numbers related to divisibility?

Prime numbers have a special relationship with divisibility: they are precisely those numbers that are divisible only by 1 and themselves. This limited divisibility is what makes prime numbers the “atomic” elements of our number system. Every positive integer greater than 1 is either a prime number or can be uniquely expressed as a product of prime numbers (known as its prime factorization). This is why prime numbers are so important in number theory and cryptography. Our calculator instantly identifies whether a number is prime by examining its full set of divisors. If the number has exactly two divisors (1 and itself), it’s prime; if it has more, it’s composite. This immediate classification helps users understand this fundamental property without manual calculation.

Why do we need divisibility rules?

Divisibility rules are valuable shortcuts that allow us to determine whether a number is divisible by another without performing the actual division calculation. These rules are particularly useful for mental math, quick checks, and developing number sense. While calculators like ours can instantly check divisibility, understanding these rules provides insight into the patterns and structure of our number system. For example, the rule that a number is divisible by 3 if the sum of its digits is divisible by 3 reveals properties of our base-10 number system and modular arithmetic. Divisibility rules also support educational objectives by encouraging pattern recognition, improving estimation skills, and building mathematical intuition. Even in our digital age, these mental shortcuts remain valuable tools for mathematical thinking and problem-solving.

How can understanding divisibility help with fractions?

Understanding divisibility is essential for working effectively with fractions. When adding or subtracting fractions with different denominators, you need to find a common denominator—often the least common multiple (LCM) of the original denominators. Identifying divisibility relationships helps determine this LCM efficiently. Similarly, when simplifying fractions to lowest terms, you need to find the greatest common divisor (GCD) of the numerator and denominator. Recognizing shared factors through divisibility checks allows you to reduce fractions correctly. Our calculator helps with both these processes by identifying all divisors of your numbers, making it easier to spot common factors and determine appropriate common denominators. This connection between divisibility and fractions demonstrates how fundamental number properties support more advanced mathematical operations.

Practical Examples of Divisibility

Let’s examine some real-world examples where divisibility concepts are applied:

Example 1: Schedule Planning

Scenario: A manager needs to schedule team meetings that occur regularly throughout a 30-day month.

Divisibility Application: To determine possible regular intervals, the manager needs to find the divisors of 30.

Solution: Using our calculator, the divisors of 30 are 1, 2, 3, 5, 6, 10, 15, and 30. This means meetings could be scheduled every day (1), every other day (2), every third day (3), every fifth day (5), every sixth day (6), every tenth day (10), every fifteenth day (15), or just once a month (30).

Example 2: Resource Distribution

Scenario: A teacher has 24 students and needs to form equal-sized groups for a project.

Divisibility Application: To determine possible group sizes, the teacher needs to find the divisors of 24.

Solution: Using our calculator, the divisors of 24 are 1, 2, 3, 4, 6, 8, 12, and 24. This means the teacher could create 24 groups of 1, 12 groups of 2, 8 groups of 3, 6 groups of 4, 4 groups of 6, 3 groups of 8, 2 groups of 12, or 1 group of 24.

Example 3: Manufacturing Optimization

Scenario: A factory needs to package 720 items into equal-sized boxes.

Divisibility Application: To determine efficient box sizes, the factory needs to find the divisors of 720.

Solution: Using our calculator reveals numerous divisors (1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16, 18, 20, 24, 30, 36, 40, 45, 48, 60, 72, 80, 90, 120, 144, 180, 240, 360, 720), providing many options for box sizes. The factory can now evaluate these options based on practical considerations like shipping efficiency and material costs.

Example 4: Cryptography

Scenario: A security system needs to generate a key based on two large prime numbers.

Divisibility Application: The security of the system relies on the difficulty of factoring the product of two large primes.

Solution: Using divisibility checking, the system can verify that candidate numbers are prime (having only 1 and themselves as divisors) before using them as encryption keys. This principle forms the basis of RSA encryption, used in secure communications worldwide.

Mathematical Foundation

Divisibility and its related concepts are grounded in fundamental mathematical principles:

  • The Division Algorithm states that for any integers a and b where b > 0, there exist unique integers q (quotient) and r (remainder) such that a = bq + r, where 0 ≤ r < b. When r = 0, a is divisible by b.
  • The Fundamental Theorem of Arithmetic establishes that every integer greater than 1 can be represented uniquely as a product of prime numbers, up to the order of the factors.
  • Euclid’s Algorithm provides an efficient method for finding the greatest common divisor (GCD) of two numbers based on divisibility properties.
  • The Chinese Remainder Theorem addresses systems of congruences related to divisibility, with applications in cryptography and computer science.
  • Fermat’s Little Theorem and Euler’s Theorem connect divisibility to modular arithmetic, forming the basis for many public-key cryptography systems.

These mathematical foundations highlight the importance of divisibility in both theoretical mathematics and practical applications.

Calculator Limitations

While our Divisibility Calculator is a powerful tool for exploring number properties, users should be aware of certain limitations:

  • The calculator works with integers only, not fractions or decimal numbers.
  • Very large numbers may be limited by browser capabilities and processing time.
  • While divisibility by numbers 1-20 is shown explicitly, the all-divisors function identifies all divisors regardless of size.
  • The calculator determines primality directly by counting divisors, which may not be the most efficient method for very large numbers.
  • Educational use should complement, not replace, understanding of mathematical concepts and processes.

This tool is provided for educational and practical purposes to enhance understanding of number properties and relationships.

Last Updated: April 6, 2025 | Next Review: April 6, 2026