最大化计算器
将数字分解为主要因素。
输入结果时更新 。
关于此计算器
Prime factorization expresses a whole number as a product of prime numbers — the unique "building blocks" that multiply to give it. This calculator returns the factorization in exponent form, the full list of prime factors, how many divisors the number has, and whether it is prime.
It works by trial division: divide out the smallest prime that fits (2s first, then 3s, then 5s, and so on) until only 1 remains, then group repeated primes into powers. For example, 360 = 2 × 2 × 2 × 3 × 3 × 5, written 2³ × 3² × 5. The number of divisors follows from the exponents — add one to each and multiply: (3+1) × (2+1) × (1+1) = 24 divisors for 360. If a number factors into just itself, it is prime.
Prime factorization is the basis for finding the GCD and LCM, reducing fractions, and public-key cryptography, whose security rests on how hard factoring very large numbers is. Every whole number above 1 has exactly one prime factorization.
经常问到的问题
什么是主要因素化?
它正在以质数制成的产物来写一个数字。 360 = 2 × 3 × 5, 通常写23 × 32 × 5。
我怎么知道一个数字是质数?
质子本身就有一个质因子。 如果系数化仅仅是数字本身,那么它就是质因子。
有多少个数字的分数?
乘数中每个指数增加一个,乘数360 = 23 × 32 × 5,因此它有(3+1) × (2+1) × (1+1) = 24 divisors。
哪个质子先算出?
最小的适合:工具将所有2个,然后是3个,然后是5个, 并持续到质数中。
Is 1 a prime number?
不存在任何首要因素,根据公约,它既不是首要因素,也不是综合因素,因此工具至少需要2个投入。
重复显示的质数是多少?
3个因素为2个因素, 3个因素为23个因素, 而不是2个因素为2个因素。
API - 使用代码中的计算器
将此计算器称为自由 JSON 端点 。 不需要按键 。 将字段值发送到下面作为查询参数或 JSON 。 任何您省略的, 都会使用相同的默认值, 此页面预填的默认值是预填的; 未知参数是 400, 而不是静音零 。 读取 API 全部文件 →
终点
GET https://calculator.free/api/v1/prime-factorization/curl
curl "https://calculator.free/api/v1/prime-factorization/?n=360"JavaScript fetch()
const r = await fetch(
"https://calculator.free/api/v1/prime-factorization/?" + new URLSearchParams({
"n": "360"
}));
const data = await r.json();
console.log(data.results);成果仅是一般指导的估计数,而不是财务、医疗或税务咨询。