- Calculators
- ::
- Numbers
- ::
- Prime Factorization Calculator
Prime factorization calculator
This calculator finds the prime factorization of a given number and creates a factor tree. Also, the calculator finds all factors, all factor pairs, and can check if the number is prime or not. The calculator generates a step-by-step explanation of how the work was done.
Find the prime factorization of number 123987456.
solution
The prime factorization of 123987456 is:
$$ 123987456 = 2\cdot2\cdot2\cdot2\cdot2\cdot2\cdot2\cdot2\cdot2\cdot3\cdot3\cdot3\cdot8969 $$Which is the same as :
$$ 123987456 = 2^{9}\cdot3^{3}\cdot8969 $$explanation
Prime factorization can be nicely visualized by creating a factorization tree.
| 123987456 can be written as 2 × 61993728. |
|
| 61993728 can be written as 2 × 30996864. |
|
| 30996864 can be written as 2 × 15498432. |
|
| 15498432 can be written as 2 × 7749216. |
|
| 7749216 can be written as 2 × 3874608. |
|
| 3874608 can be written as 2 × 1937304. |
|
| 1937304 can be written as 2 × 968652. |
|
| 968652 can be written as 2 × 484326. |
|
| 484326 can be written as 2 × 242163. |
|
| 242163 can be written as 3 × 80721. |
|
| 80721 can be written as 3 × 26907. |
|
| 26907 can be written as 3 × 8969. |
|
| The end nodes are the prime factors of the number 123987456. |
|
What is prime factorization?
Prime factorization is a process of finding the group of prime numbers such that when multiplied together, they give the original number. For example, the prime factorization of 15 is 5 * 3, because 5 and 3 are both prime numbers that when multiplied together yield 15. This calculator computes prime factorization and factor trees for every integer up to 21474836460000.
Find the prime factorization and factor tree for 60.
Step 1: Start with any number that divides 60; for our example, we will select 10.
-
60
-
10
-
6
-
Step 2: Write 10 as a product of 2 and 5. $ \color{blue}{10 = 2 \cdot 5} $.
-
60
-
10
-
5
-
2
-
-
6
-
Step 3: Write 6 as a product of 2 and 3. $ 6 = 2 \cdot 3 $.
-
60
-
10
-
5
-
2
-
-
6
-
2
-
3
-
-
Step 4: The end nodes are the prime factors of 60.
-
60
-
10
-
5
-
2
-
-
6
-
2
-
3
-
-
Finding all factors
Example: Find all factors of 54.
Step 1: Begin the list with 1 and end it with 54.
Step 2: Since $ 54 = 2 \cdot 27 $ we put in 2 and 27 into an array.
Step 3: Since $ 54 = 3 \cdot 18 $ so we will put in 3 and 18 into an array.
Step 4:At the end we have $ 54 = 6 \cdot 9 $
Check if the number is prime
Example: Check whether a number 581 is prime or not.
Step 1: Find the square root of 581.
Step 2: Try to divide 581 by all prime numbers less or equal to 25.
In this example we will try to divide 581 with :
2 , 3, 5, 7, 11, 13, 17, 19
and 23.
$$ \begin{aligned} 581 : 2 & = 290.5 \\ 581 : 3 & = 484 \\ 581 : 5 &= 116.2 \\ 581 : 7 &= 83 \end{aligned} $$
581 is divisible by 3 so is is not prime.
1. Prime Factorization - video tutorial
2. Prime Factorization : Definition, Methods, Examples, FAQs
3. Prime Factorization test with video solutuins.
4. Print all prime factors - code in C++, C, Java, Python, C#, Javascript and PHP.