Prime Numbers 50 to 150
2026-02-28 08:58 Diff
https://brightchamps.com/en-us/math/numbers/prime-numbers-50-to-150

Prime numbers are a set of natural numbers that can only be divided by 1 and the number itself. Here are the two important ways to find whether a number is prime or not.

By Divisibility Method:

To find whether a number is prime or not, we use the divisibility method to check. If a number is divisible by 2, 3, 5, or 7, then it will result in a non-prime number. Prime numbers are only divisible by 1 and itself, so if a number is divisible by the number itself and 1, it is considered a prime number.

For example: To check whether 61 is a prime number,

Step 1: 61 ÷ 2 = 30.5 (remainder ≠ 0)

Step 2: 61 ÷ 3 = 20.33 (remainder ≠ 0)

Step 3: 61 ÷ 5 = 12.2 (remainder ≠ 0)

Step 4: 61 ÷ 7 = 8.71 (remainder ≠ 0)

Since no divisors are found, 61 is a prime number.

By Prime Factorization Method:

The prime factorization method is the process of breaking down a composite number into the product of its prime factors. The method of prime factorization helps to identify the prime numbers up to 150 by building the smallest blocks of any given number.

For example: The prime factorization of 150: Let's break it down into the smallest prime numbers until it can’t divide anymore.

Step 1: 150 ÷ 2 = 75

Step 2: Now, we divide 75, 75 ÷ 3 = 25

Step 3: Now take 25, since 25 ends in 5, divide the number with 5 25 ÷ 5 = 5

Step 4: At last, take 5. 5 ÷ 5 = 1 (since 5 is a prime number, and dividing by 5 gives 1)

Therefore, the prime factorization of 150 is: 150 = 2 × 3 × 5².