👁 Preview — Study, Practice and Revise are open; mock tests and the rest of the syllabus unlock on subscription. Unlock all · ₹4,999
← Back to Arithmetic and Number Systems
Study mode

Number properties

Introduction to Number Properties

Number properties form the foundation of many quantitative aptitude problems you will encounter in competitive exams. Understanding these properties helps you simplify calculations, recognize patterns, and solve problems more efficiently. Whether you are dealing with large numbers or complex arithmetic, knowing how numbers behave under different operations can save you valuable time and reduce errors.

In this section, we will explore the fundamental types of numbers, learn divisibility rules that help quickly check factors, understand how to find factors and multiples, and study the behavior of even and odd numbers in arithmetic operations. We will also look at special number concepts like perfect squares and cubes, which often appear in exam questions.

Types of Numbers

Before diving into properties, it is essential to classify numbers into different types. Each type has unique characteristics that influence how they interact in arithmetic.

Classification of Numbers
Number Type Definition Examples
Natural Numbers Counting numbers starting from 1 1, 2, 3, 4, 5, ...
Whole Numbers Natural numbers including zero 0, 1, 2, 3, 4, 5, ...
Integers Whole numbers and their negatives ..., -3, -2, -1, 0, 1, 2, 3, ...
Prime Numbers Numbers greater than 1 with exactly two distinct positive divisors: 1 and itself 2, 3, 5, 7, 11, 13, 17, ...
Composite Numbers Numbers greater than 1 with more than two positive divisors 4, 6, 8, 9, 10, 12, 14, ...
Even Numbers Integers divisible by 2 ..., -4, -2, 0, 2, 4, 6, 8, ...
Odd Numbers Integers not divisible by 2 ..., -3, -1, 1, 3, 5, 7, 9, ...

Why is this important? Knowing the type of number helps you apply the correct rules and properties. For example, prime numbers have unique factorization properties, and even/odd numbers behave predictably under addition and multiplication.

Divisibility Rules

Divisibility rules are shortcuts to determine whether a number can be divided evenly by another number without performing full division. These rules are especially useful in exams to quickly check factors or simplify problems.

Divisibility Rules Summary
Divisor Rule Example
2 Number ends with 0, 2, 4, 6, or 8 124 is divisible by 2
3 Sum of digits divisible by 3 123 (1+2+3=6), divisible by 3
5 Number ends with 0 or 5 145 ends with 5, divisible by 5
9 Sum of digits divisible by 9 729 (7+2+9=18), divisible by 9
10 Number ends with 0 230 ends with 0, divisible by 10
4 Last two digits form a number divisible by 4 312 (last two digits 12), divisible by 4
6 Number divisible by both 2 and 3 114 divisible by 2 and 3, so by 6
8 Last three digits form a number divisible by 8 1,024 (024 divisible by 8)
11 Difference between sum of digits in odd and even places divisible by 11 2728: (2+2) - (7+8) = 4 - 15 = -11 divisible by 11

Why use divisibility rules? They help you quickly identify factors, simplify fractions, and check prime/composite status without long division.

Factors and Multiples

Understanding factors and multiples is essential for solving problems involving divisibility, fractions, and algebraic expressions.

Factors

A factor of a number is an integer that divides the number exactly without leaving a remainder. For example, factors of 12 are 1, 2, 3, 4, 6, and 12.

Multiples

A multiple of a number is the product of that number and any integer. For example, multiples of 5 are 5, 10, 15, 20, and so on.

Greatest Common Divisor (GCD)

The GCD of two numbers is the largest number that divides both numbers exactly. It is useful for simplifying fractions and solving problems involving ratios.

Least Common Multiple (LCM)

The LCM of two numbers is the smallest number that is divisible by both. It helps in adding or subtracting fractions and solving problems involving synchronized events.

graph TD    A[Start: Given two numbers a and b] --> B[Find prime factorization of a]    B --> C[Find prime factorization of b]    C --> D[Identify common prime factors with minimum exponents]    D --> E[GCD = Product of these common prime factors]    D --> F[Identify all prime factors with maximum exponents]    F --> G[LCM = Product of these prime factors]    E --> H[End]    G --> H

Why prime factorization? Breaking numbers into prime factors helps systematically find GCD and LCM without guesswork.

Properties of Even and Odd Numbers

Even and odd numbers follow specific rules under arithmetic operations. Knowing these rules helps quickly determine the parity (evenness or oddness) of results.

Even and Odd Number Properties
Operation Even ± Even Odd ± Odd Even ± Odd Even x Even Odd x Odd Even x Odd
Result Even Even Odd Even Odd Even

Examples:

  • 4 + 6 = 10 (Even + Even = Even)
  • 7 + 9 = 16 (Odd + Odd = Even)
  • 4 + 5 = 9 (Even + Odd = Odd)
  • 2 x 8 = 16 (Even x Even = Even)
  • 3 x 5 = 15 (Odd x Odd = Odd)
  • 4 x 7 = 28 (Even x Odd = Even)

Why does this matter? These properties help you predict outcomes without calculation, useful in algebra and number theory problems.

Example 1: Finding GCD and LCM of 36 and 48 Easy
Find the Greatest Common Divisor (GCD) and Least Common Multiple (LCM) of 36 and 48 using prime factorization.

Step 1: Find the prime factors of 36.

36 = 2 x 2 x 3 x 3 = \(2^2 \times 3^2\)

Step 2: Find the prime factors of 48.

48 = 2 x 2 x 2 x 2 x 3 = \(2^4 \times 3^1\)

Step 3: For GCD, take the minimum powers of common primes.

GCD = \(2^{\min(2,4)} \times 3^{\min(2,1)} = 2^2 \times 3^1 = 4 \times 3 = 12\)

Step 4: For LCM, take the maximum powers of all primes.

LCM = \(2^{\max(2,4)} \times 3^{\max(2,1)} = 2^4 \times 3^2 = 16 \times 9 = 144\)

Answer: GCD = 12, LCM = 144

Example 2: Checking Divisibility of 12345 by 3, 5 and 11 Medium
Determine if 12,345 is divisible by 3, 5, and 11 using divisibility rules.

Step 1: Check divisibility by 3.

Sum of digits = 1 + 2 + 3 + 4 + 5 = 15

Since 15 is divisible by 3, 12,345 is divisible by 3.

Step 2: Check divisibility by 5.

Last digit is 5, so 12,345 is divisible by 5.

Step 3: Check divisibility by 11.

Sum of digits at odd places (from right): 5 + 3 + 1 = 9

Sum of digits at even places: 4 + 2 = 6

Difference = 9 - 6 = 3 (not divisible by 11)

Therefore, 12,345 is not divisible by 11.

Answer: Divisible by 3 and 5, but not by 11.

Example 3: Sum of Even and Odd Numbers Problem Medium
If the sum of two numbers is 45 and one is even while the other is odd, what is the parity of their product?

Step 1: Identify the parity of the two numbers.

One number is even, the other is odd.

Step 2: Sum of even + odd = odd (given sum is 45, which is odd, consistent).

Step 3: Product of even x odd = even (from properties table).

Answer: The product of the two numbers is even.

Example 4: Prime or Composite? Test 97 Easy
Determine whether 97 is a prime or composite number.

Step 1: Check divisibility by prime numbers up to \(\sqrt{97} \approx 9.8\).

Check divisibility by 2, 3, 5, 7.

97 is not even, so not divisible by 2.

Sum of digits = 9 + 7 = 16, not divisible by 3, so no.

Last digit not 0 or 5, so not divisible by 5.

Check divisibility by 7: 7 x 13 = 91, 7 x 14 = 98, so no.

No divisors found, so 97 is prime.

Answer: 97 is a prime number.

Example 5: Predicting Next Number in Perfect Square Sequence Hard
Given the sequence 1, 4, 9, 16, 25, ..., find the next two numbers.

Step 1: Identify the pattern.

These are perfect squares: \(1^2=1\), \(2^2=4\), \(3^2=9\), \(4^2=16\), \(5^2=25\).

Step 2: Find the next two squares.

Next numbers: \(6^2 = 36\), \(7^2 = 49\).

Answer: The next two numbers are 36 and 49.

Greatest Common Divisor (GCD)

\[\mathrm{GCD}(a,b) = \prod p_i^{\min(e_i, f_i)}\]

Highest number dividing both a and b without remainder, from prime factors

\(p_i\) = Prime factors
\(e_i, f_i\) = Exponents of p_i in a and b

Least Common Multiple (LCM)

\[\mathrm{LCM}(a,b) = \prod p_i^{\max(e_i, f_i)}\]

Smallest number divisible by both a and b, from prime factors

\(p_i\) = Prime factors
\(e_i, f_i\) = Exponents of p_i in a and b

Relation between GCD and LCM

\[\mathrm{GCD}(a,b) \times \mathrm{LCM}(a,b) = a \times b\]

Product of GCD and LCM equals product of the two numbers

a,b = Two integers
Key Concept

Even and Odd Number Properties

Even ± Even = Even; Odd ± Odd = Even; Even ± Odd = Odd; Even x Even = Even; Odd x Odd = Odd; Even x Odd = Even

Tips & Tricks

Tip: Sum of digits divisible by 3 or 9 indicates divisibility by 3 or 9 respectively.

When to use: Quickly check divisibility by 3 or 9 without long division.

Tip: If the last digit is 0 or 5, the number is divisible by 5.

When to use: Quickly identify multiples of 5 in problems.

Tip: Use prime factorization or Euclid's algorithm for faster and accurate GCD calculation.

When to use: Finding GCD of large numbers or simplifying fractions.

Tip: Use the relation GCD x LCM = product of numbers to find one if the other is known.

When to use: When either GCD or LCM is missing in a problem.

Tip: Remember parity rules: Even ± Even = Even; Odd ± Odd = Even; Even ± Odd = Odd.

When to use: Problems involving sums or differences of even and odd numbers.

Common Mistakes to Avoid

❌ Confusing prime numbers with composite numbers, especially small primes like 1 or even numbers.
✓ Remember that prime numbers have exactly two distinct positive divisors: 1 and itself. Number 1 is neither prime nor composite.
Why: Students often assume 1 or even numbers are prime without checking divisibility.
❌ Incorrectly applying divisibility rules, such as summing digits for divisibility by 11.
✓ Use the correct rule for 11: difference between sum of digits in odd and even places must be divisible by 11.
Why: Mixing divisibility rules leads to wrong conclusions.
❌ Forgetting to include all prime factors when finding GCD or LCM.
✓ List all prime factors with correct exponents before calculating GCD or LCM.
Why: Skipping factors leads to incorrect GCD or LCM results.
❌ Assuming sum of two odd numbers is odd.
✓ The sum of two odd numbers is always even.
Why: Misunderstanding parity properties causes errors in problem-solving.
❌ Using division instead of prime factorization or Euclid's algorithm for GCD and LCM in complex problems.
✓ Use prime factorization or Euclid's algorithm for accuracy and efficiency.
Why: Division method is slower and prone to mistakes with large numbers.
✨ AI exam tools — try them free (included in every plan)
Tip: select any text above to Explain / Example / Simplify it.
Curated videos per subtopic
Top YouTube explainers, AI-ranked for your exam and language. Unlocks with subscription.
Unlock

Try Practice next.

Progress tracking is paywalled — subscribe to mark subtopics as understood and save your streak.

Go to practice →
Ask a doubt
Number properties · 10 free messages
Ask me anything about this subtopic. You have 10 free messages this session — chat history isn't saved in preview.