Playing with Numbers

Playing with Numbers

Playing with Numbers

Exploring Divisibility, Factors, Multiples, and Primes (6th Standard)

This interactive chapter allows students to explore the fun side of numbers by checking **divisibility rules**, finding **factors**, identifying **prime and composite** numbers, and performing **prime factorization**.

Key Topics & Instructions

Chapter Objectives:
  • Define and find factors and multiples.
  • Differentiate between prime and composite numbers.
  • Apply divisibility rules for 2, 3, 4, 5, 6, 8, 9, 10, and 11.
  • Determine prime factorization using a factor tree.
  • Calculate HCF and LCM.
How to Use:
  1. Enter a number in Experiment 1 to instantly check its divisibility status.
  2. Use Experiment 2 to find the Prime Factorization of a number.

Experiment 1: Divisibility Rule Checker

Input a number (up to 6 digits) and check if it is divisible by common numbers (2 to 11).

Sum of Digits (Divisibility by 3/9)
18
**Divisibility Check:**
By 2: Yes
By 3: Yes
By 9: Yes

Experiment 2: Prime Factorization Finder

Enter a number to find its prime factors.

All Factors
1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90
Prime Factorization
2 × 3 × 3 × 5
Prime and Composite Numbers:

A **Prime Number** has exactly two factors: 1 and the number itself (e.g., 2, 3, 5, 7, 11). A **Composite Number** has more than two factors (e.g., 4, 6, 8, 9, 10). The number **1** is neither prime nor composite.

Divisibility Rule for 11

A number is divisible by 11 if the difference between the sum of its digits at **odd places** (from the right) and the sum of its digits at **even places** (from the right) is either **0** or a **multiple of 11**.

Example: For 121, Sum of Odd Places (1+1)=2. Sum of Even Places (2)=2. Difference = $2 - 2 = 0$. Thus, 121 is divisible by 11.

Titration of Vinegar

Acid-Base Titration with NaOH and Phenolphthalein

Titration of Vinegar

Acid-Base Titration with NaOH and Phenolphthalein

Leave a Comment

Your email address will not be published. Required fields are marked *

MedhaAI
Ask Medha AI
Scroll to Top