Prime Factorization (Displayed with prime factors and exponents side by side)
Author: hidekchi45Executions: 2696
※ This library was created by a member. This site is not responsible for its content.
Prime Factorization (Displayed with prime factors and exponents) Last updated February 22, 2022
If the number can be factored, the result will always be correct once the calculation is complete; however, because the process is slow, the search for prime factors is limited to 500,000 to prevent a timeout. If you factor the numbers displayed as intermediate results again, there is a possibility you can factor the number all the way to the end.
Please rest assured that this calculator does not display false prime factorization results, such as those from so-called “trial division” methods.
A high-performance version is also available. Although it takes longer, it significantly increases the likelihood of successfully factoring large numbers.
○ 10-digit Mersenne prime: 2147483647 = 2^31－1
○ 12-digit Euclidean prime: 200560490131 = 31 × 29 × 23 × 19 × 17 × 13 × 11 × 7 × 5 × 3 × 2 + 1
✖ 14-digit prime: 92709568269121 ✖ 16-digit prime: 9007199254740997
All of the following are composite numbers
○125129118027271453 = 277⁷ ○515377520732011331036461129765621272702107522001= 3^100
✖ 5000009111777111
✖ 13-digit composite number: 1565912117761 = 1162193 × 1347377
× 16-digit composite number: 8635844967113809 = 89652331 × 96325939
○ 16!: 20922789888000 ○ 17!: 355687428096000 ○ 18!: 6402373705728000
〇19!: 1,216,451,004,088,320,000 〇20!: 2,432,902,008,176,640,000 〇21!: 5,109,094,217,170,944,000
〇2341695598348007663 ✖123456789012345678901 〇1111111111111111 ✖999999000001
△99999999999999999
Please rest assured that this calculator does not display false prime factorization results, such as those from so-called “trial division” methods.
A high-performance version is also available. Although it takes longer, it significantly increases the likelihood of successfully factoring large numbers.
○ 10-digit Mersenne prime: 2147483647 = 2^31－1
○ 12-digit Euclidean prime: 200560490131 = 31 × 29 × 23 × 19 × 17 × 13 × 11 × 7 × 5 × 3 × 2 + 1
✖ 14-digit prime: 92709568269121 ✖ 16-digit prime: 9007199254740997
All of the following are composite numbers
○125129118027271453 = 277⁷ ○515377520732011331036461129765621272702107522001= 3^100
✖ 5000009111777111
✖ 13-digit composite number: 1565912117761 = 1162193 × 1347377
× 16-digit composite number: 8635844967113809 = 89652331 × 96325939
○ 16!: 20922789888000 ○ 17!: 355687428096000 ○ 18!: 6402373705728000
〇19!: 1,216,451,004,088,320,000 〇20!: 2,432,902,008,176,640,000 〇21!: 5,109,094,217,170,944,000
〇2341695598348007663 ✖123456789012345678901 〇1111111111111111 ✖999999000001
△99999999999999999
I suspect that the prime factorization feature provided by Casio is likely different in terms of CPU allocation. Since this was created within the scope of features intended for general users, it is completely outclassed in performance by Casio’s official prime factorization tool.Since the official version doesn’t display the number of times a prime factor appears, this version provides a clearer presentation of the results. Additionally,
the fact that it can perform prime factorization on numbers up to 51 digits long is an advantage over Casio’s official version.
the fact that it can perform prime factorization on numbers up to 51 digits long is an advantage over Casio’s official version.
No customer feedback for this calculation yet.