Q: What is the prime factorization of the number 560,731,432?

 A:
  • The prime factors are: 2 x 2 x 2 x 47 x 911 x 1,637
    • or also written as { 2, 2, 2, 47, 911, 1,637 }
  • Written in exponential form: 23 x 471 x 9111 x 1,6371

Why is the prime factorization of 560,731,432 written as 23 x 471 x 9111 x 1,6371?

What is prime factorization?

Prime factorization or prime factor decomposition is the process of finding which prime numbers can be multiplied together to make the original number.

Finding the prime factors of 560,731,432

To find the prime factors, you start by dividing the number by the first prime number, which is 2. If there is not a remainder, meaning you can divide evenly, then 2 is a factor of the number. Continue dividing by 2 until you cannot divide evenly anymore. Write down how many 2's you were able to divide by evenly. Now try dividing by the next prime factor, which is 3. The goal is to get to a quotient of 1.

If it doesn't make sense yet, let's try it...

Here are the first several prime factors: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29...

Let's start by dividing 560,731,432 by 2

560,731,432 ÷ 2 = 280,365,716 - No remainder! 2 is one of the factors!
280,365,716 ÷ 2 = 140,182,858 - No remainder! 2 is one of the factors!
140,182,858 ÷ 2 = 70,091,429 - No remainder! 2 is one of the factors!
70,091,429 ÷ 2 = 35,045,714.5 - There is a remainder. We can't divide by 2 evenly anymore. Let's try the next prime number
70,091,429 ÷ 3 = 23,363,809.6667 - This has a remainder. 3 is not a factor.
70,091,429 ÷ 5 = 14,018,285.8 - This has a remainder. 5 is not a factor.
70,091,429 ÷ 7 = 10,013,061.2857 - This has a remainder. 7 is not a factor.
...
Keep trying increasingly larger numbers until you find one that divides evenly.
...
70,091,429 ÷ 47 = 1,491,307 - No remainder! 47 is one of the factors!
1,491,307 ÷ 47 = 31,729.9362 - There is a remainder. We can't divide by 47 evenly anymore. Let's try the next prime number
1,491,307 ÷ 53 = 28,137.8679 - This has a remainder. 53 is not a factor.
1,491,307 ÷ 59 = 25,276.3898 - This has a remainder. 59 is not a factor.
1,491,307 ÷ 61 = 24,447.6557 - This has a remainder. 61 is not a factor.
...
Keep trying increasingly larger numbers until you find one that divides evenly.
...
1,491,307 ÷ 911 = 1,637 - No remainder! 911 is one of the factors!
1,637 ÷ 911 = 1.7969 - There is a remainder. We can't divide by 911 evenly anymore. Let's try the next prime number
1,637 ÷ 919 = 1.7813 - This has a remainder. 919 is not a factor.
1,637 ÷ 929 = 1.7621 - This has a remainder. 929 is not a factor.
1,637 ÷ 937 = 1.7471 - This has a remainder. 937 is not a factor.
...
Keep trying increasingly larger numbers until you find one that divides evenly.
...
1,637 ÷ 1,637 = 1 - No remainder! 1,637 is one of the factors!

The orange divisor(s) above are the prime factors of the number 560,731,432. If we put all of it together we have the factors 2 x 2 x 2 x 47 x 911 x 1,637 = 560,731,432. It can also be written in exponential form as 23 x 471 x 9111 x 1,6371.

Factor Tree

Another way to do prime factorization is to use a factor tree. Below is a factor tree for the number 560,731,432.

560,731,432
Factor Arrows
2280,365,716
Factor Arrows
2140,182,858
Factor Arrows
270,091,429
Factor Arrows
471,491,307
Factor Arrows
9111,637

More Prime Factorization Examples

560,731,430560,731,431560,731,433560,731,434
21 x 51 x 71 x 8,010,449131 x 131 x 4311 x 33,3591560,731,433121 x 31 x 171 x 3591 x 15,3131

Try the factor calculator

Explore more about the number 560,731,432:


Ask a Question