Prime Factorisation Calculator

Introduction

Prime factorisation is a foundational process in number theory, revealing the basic building blocks from which an integer is constructed. This tool performs the prime factorisation of an integer $n$ to uncover its underlying numerical structure. Identifying prime factors is essential for students exploring number theory, as it allows for the decomposition of composite values into a unique product of primes $p$ . It provides insights into the arithmetic properties and divisibility of numbers within a specified range.

What this calculator does

To determine its prime decomposition, the calculator evaluates the positive integer input. It outputs the prime factors, the exponential form, and the total count of prime factors. Additionally, it computes number-theoretic functions including the number of divisors, the sum of divisors $σ$ , the product of divisors, and Euler's totient function $ϕ$ . Results are supplemented by a step-by-step division breakdown and visual distribution charts.

Formula used

The sum of divisors $σ$ is calculated using the geometric series formula for each prime factor $p$ with exponent $a$ . Euler's totient $ϕ$ is derived via the product formula. The number of divisors involves the product of each incremented exponent.

σ = \prod \frac{p^{a + 1} - 1}{p - 1}

ϕ = n \prod (1 - \frac{1}{p})

How to use this calculator

1. Enter a positive integer between 2 and 10,000,000.
2. Select the desired number of decimal places for the computed outputs.
3. Execute the calculation to generate the prime factorisation results.
4. Review the data tables and charts for mathematical analysis.

Example calculation

Scenario: Analysing the divisor properties of a specific value during a number theory study to determine its classification and the sum of its divisors.

Inputs: Integer $n$ equal to $12$ ; decimal places set to $2$ .

Working:

Step 1: $12 = 2^{2} \times 3^{1}$

Step 2: $σ = (\frac{2^{3} - 1}{2 - 1}) \times (\frac{3^{2} - 1}{3 - 1})$

Step 3: $σ = 7 \times 4$

Step 4: $σ = 28$

Result: 28.00

Interpretation: The sum of all divisors of 12, including 1 and itself, is 28.

Summary: The value 12 is composite with a totient of 4.

Understanding the result

The output identifies the number as Prime or Composite. The Euler's totient value indicates the count of integers up to $n$ that are relatively prime to it. A "Yes" for the perfect number status confirms if the sum of proper divisors equals the original integer.

Assumptions and limitations

The calculator assumes the input is a positive integer within the domain of 2 to 10,000,000. It uses floating-point arithmetic for divisor sums and totient calculations, which may introduce minor rounding variations at extremely high precision settings.

Common mistakes to avoid

Errors often occur when entering non-integer values or numbers outside the defined range. Users should ensure the input is a whole number, as fractions and decimals are not supported for prime factorisation. Misinterpreting the sum of divisors as only proper divisors is another frequent conceptual error.

Sensitivity and robustness

The calculation is discrete and stable; small changes in the integer input lead to entirely different factorisation results rather than incremental shifts. The algorithm is robust for the defined range, ensuring accurate decomposition for both small primes and large composite integers.

Troubleshooting

If an error message appears, verify that the input contains no special characters or symbols and falls between 2 and 10,000,000. Ensure the CSRF token is valid by refreshing the page if the session has expired, which is necessary for secure data submission.

Frequently asked questions

What is the exponential form?

It is a way of expressing the prime factorisation where repeated prime factors are written as a base raised to a power representing their frequency.

What does Euler's Totient represent?

It represents the number of positive integers less than or equal to n that do not share any common factors with n other than 1.

How is a perfect number determined?

A number is classified as perfect if the sum of its divisors, excluding the number itself, is exactly equal to the original integer.

Where this calculation is used

Prime factorisation is a foundational concept in number theory and algebra, used to find the greatest common divisor and least common multiple of sets of numbers. In academic settings, it is applied to simplify radicals and solve modular arithmetic problems. It is also instrumental in mathematical modelling when analysing periodicities or cyclical patterns in population studies. Students use these principles to understand the Fundamental Theorem of Arithmetic, which states that every integer greater than one has a unique prime factorisation.

Results are based on standard mathematical and statistical methods and may involve rounding or approximation. If precise accuracy is required, please verify results independently. See full disclaimer.