Calculatrice de décomposition en facteurs premiers
Guide
Calculatrice de décomposition en facteurs premiers
Break down any integer into its prime factors instantly. This calculator decomposes numbers into their fundamental building blocks — the prime numbers that multiply together to produce the original value. Whether you’re working through math homework, exploring number theory, or just curious about what makes a number tick, get the full factorization with multiple output formats.
Comment utiliser
Enter any positive integer into the input field and click “Factorize.” The calculator instantly breaks it down and shows you the prime factors in multiple formats: a simple list, exponential notation (like 2² × 3 × 5), a visual factor tree, all divisors of the number, and a step-by-step breakdown of the factorization process. Copy any result with one click.
Caractéristiques
- — Heure locale, UTC, ISO 8601 et temps relatif (« il y a 3 heures ») tout à la fois. – View prime factors as a list, in exponential notation, or as a visual factor tree diagram
- All divisors – See every number that divides evenly into your input, not just the prime factors
- Step-by-step process – Follow the exact division steps used to arrive at the factorization
- Factor tree visualization – A branching tree diagram showing how the number splits into primes
- Large number support – Handles integers up to 9,007,199,254,740,991 (2⁵³ – 1)
- Instant results – All computation happens client-side with no server calls
Understanding Prime Factorization
Every integer greater than 1 can be expressed as a unique product of prime numbers — this is the Fundamental Theorem of Arithmetic. Prime factorization is the process of finding those primes. For example, 360 = 2³ × 3² × 5. This decomposition is unique to every number and forms the basis for concepts like GCD, LCM, and modern cryptography (RSA encryption relies on the difficulty of factoring very large numbers).
FAQ
What is the Fundamental Theorem of Arithmetic?
The Fundamental Theorem of Arithmetic states that every integer greater than 1 is either a prime number itself or can be represented as a unique product of prime numbers, regardless of the order of the factors. This means 12 will always factor into 2 × 2 × 3, no matter how you approach the factorization.
Why is prime factorization important in cryptography?
RSA encryption relies on the fact that multiplying two large primes is easy, but factoring the result back into those primes is extremely difficult for large numbers. A 2048-bit RSA key involves primes so large that no known algorithm can factor them in a reasonable timeframe, making the encryption secure.
How do you find the GCD of two numbers using prime factorization?
Factor both numbers into primes, then multiply together the common prime factors using the lowest exponent each shares. For example, GCD(360, 150): 360 = 2³ × 3² × 5 and 150 = 2 × 3 × 5². The common primes at lowest powers are 2¹ × 3¹ × 5¹ = 30.
What makes a number prime vs. composite?
A prime number has exactly two distinct factors: 1 and itself. A composite number has additional factors beyond 1 and itself, meaning it can be broken down further into smaller prime components. The number 1 is neither prime nor composite by mathematical convention.
Installez nos extensions
Ajoutez des outils IO à votre navigateur préféré pour un accès instantané et une recherche plus rapide
恵 Le Tableau de Bord Est Arrivé !
Tableau de Bord est une façon amusante de suivre vos jeux, toutes les données sont stockées dans votre navigateur. D'autres fonctionnalités arrivent bientôt !
Outils essentiels
Tout voir Nouveautés
Tout voirMise à jour: Notre dernier outil a été ajouté le 17 mars 2026
Impliquez-vous
Aidez-nous à continuer à fournir des outils gratuits et précieux
