The number 144 is divisible by the prime numbers 2 and ___
Given: The number 144
To find the prime factors of 144 other than 2
Solution:
The prime factorization of 144 is as follows
$144 = 2\times 2\times 2\times 2\times 3\times 3$
So the number 144 is divisible by prime numbers 2 and 3.
Related Articles
- Determine if 25110 is divisible by 45.[Hint : 5 and 9 are co-prime numbers. Test the divisibility of the number by 5 and 9 ].
- Which of the following statements are true?(i) If a number is divisible by 3, it must be divisible by 9.(ii) If a number is divisible by 9, it must be divisible by 3.(iii) If a number is divisible by 4, it must be divisible by 8.(iv) If a number is divisible by 8, it must be divisible by 4.(v) A number is divisible by 18, if it is divisible by both 3 and 6.(vi) If a number is divisible by both 9 and 10, it must be divisible by 90.(vii) If a number exactly divides the sum of two numbers, it must exactly divide the numbers separately.(viii) If a number divides three numbers exactly, it must divide their sum exactly.(ix) If two numbers are co-prime, at least one of them must be a prime number.(x) The sum of two consecutive odd numbers is always divisible by 4.
- A number is divisible by $12$. By what other numbers will that number be divisible?
- Print the nearest prime number formed by adding prime numbers to N
- C# Program to find whether the Number is Divisible by 2
- Multiply the given number by 2 such that it is divisible by 10
- Find the number of natural numbers between 101 and 999 which are divisible by both 2 and 5.
- Which of the following statements are true?(a) If a number is divisible by 3, it must be divisible by 9.(b) If a number is divisible by 9, it must be divisible by 3.(c) A number is divisible by 18, if it is divisible by both 3 and 6.(d) If a number is divisible by 9 and 10 both, then it must be divisible by 90.(e) If two numbers are co-primes, at least one of them must be prime.(f) All numbers which are divisible by 4 must also be divisible by 8.(g) All numbers which are divisible by 8 must also be divisible by 4.(h) If a number exactly divides two numbers separately, it must exactly divide their sum.(i) If a number exactly divides the sum of two numbers, it must exactly divide the two numbers separately.
- Counting prime numbers from 2 upto the number n JavaScript
- Find the smallest square number that is divisible by each of the numbers 5, 15 and 45.
- Find the least number that is divisible by all the numbers between 1 and 10 (both inclusive).
- How to find whether the Number is Divisible by 2 using C#?
- Find if nCr is divisible by the given prime in C++
- Find the Numbers that are not divisible by any number in the range [2, 10] using C++
- Check if a number is divisible by all prime divisors of another number in C++
Kickstart Your Career
Get certified by completing the course
Get Started