Prime Factorization
Find prime factors and divisors of any number
How to use Prime Factorization
- 1Enter a positive number greater than 1.
- 2Runs the calculator to decompose it into a prime factor.
- 3View the list of prime numbers with an index, e.g. 360 = 23 x 32 x 5.
Factorial Details
n = p1^a1 x p2^a2 × ... (per p is prime)The factor breakdown represents the product of a prime number, the only construction unit for each integer greater than 1.
It is the basis for seeking the maximum number of conventions, the minimum common multiple, cryptographics and the determination of primes or total aluminum.
An arithmetical fundamental theorem guarantees:** Each integer greater than 1 is the only product decomposition to a prime factor** (without order). This "uniqueness" seems to be a natural thing, but it's really the cornerstone of the math. It ensures that the only, GCD and LCM calculations of the results of the scores are certain answers. If it's not the only one, the whole primary theory will collapse.
A practical decomposition method is "test-out": Start with the smallest prime 2 and try again 3 and 5 and 7... every time until it can no longer be removed. The key optimisation is that ** needs only to try **n** - if n has a factor greater than **n, then it has to match a factor smaller than **n. For example, decomposition 97, which can be determined to be a prime number by just trying √97 ≈ 9.8, i.e. not at all at 2, 3, 5, 7. This optimization has led to a significant reduction in the time spent on large-digit breakdown.
| Numbers | Factorial | prime factors | Whether to be prime |
|---|---|---|---|
| 12 | 2² × 3 | 2 types | Yes |
| 60 | 2² × 3 × 5 | 3 | Yes |
| 100 | 2² × 5² | 2 types | Yes |
| 360 | 2³ × 3² × 5 | 3 | Yes |
| 1,001 | 7 × 11 × 13 | 3 | Yes |
| 97 | 97 | — | Yes. |
Fragmentation of prime factors for common numbers
Frequently asked questions
Why the only one?
The arithmetical fundamental theorem indicates that each integer has only one prime factor split.
And one?
1 Not prime; no prime; decomposition starts with 2.
How much can you handle?
The trial division is no problem up to a million levels; a great number requires an advanced algorithm.
Is that a prime number?
Nope. A prime number is defined as a "natural number greater than 1 and that can only be divided by 1 and by itself" and is explicitly excluded. The reason why 1 is excluded is precisely to ensure the soleness of decomposition - if 1 is allowed as a prime factor, 12 can be written as 22x3, 1x22x3, 12x22x3... and an infinite number of "decompositions", and the arithmetical fundamentals are invalidated. It's a mathematically defined choice to keep the theory comfortable.
Why is large-digit breakdown the basis of cryptography?
It is extremely difficult to break up. Multiplication of two large prime numbers is easy (computer instantaneously completed), but in turn the product is divided back into two prime numbers, which takes thousands of years for hundreds of digits to use the fastest algorithms and supercomputers. RSA encryption uses this "one-way" type: the public key is the product of two large prime numbers (public) and the private key is both. The current shor algorithm of quantum computers can theoretically rapidly decompose large numbers, which is why the postquantography study.