You are using the new UI (Beta).Return to the original UI

This page has been automatically translated by machine translation. Please note that translations may not be entirely accurate.

keisanHigh-precision calculations for everyday life and work

Calculates the number of positive divisors and their sum. (3 prime factors)

Author: shiroeExecutions: 71

※ This library was created by a member. This site is not responsible for its content.

Manage Bookmarks
We will calculate the number of positive divisors and their sum.
For a composite number whose prime factors are three primes P, Q, and R, we will consider the number of positive divisors
and their sum.
P, Q, and R are all limited to primes less than 1,000.
Enter the prime numbers P, Q, and R.
Enter three distinct prime numbers for P, Q, and R.
(1 is not treated as a prime number. Any number other than a prime number
will be considered an invalid input.)
Composite numbers are expressed in the form (P^a)(Q^b)(R^c).
Enter positive numbers for P, Q, R, a, b, and c.
Enter positive integers for a, b, and c.
Inputs outside these limits will be considered invalid and will not be output.
P
a  Exponent of P
Q
b  Exponent of Q
R
c  Exponents in R
P's Adopted Values The adopted value for a 
Q's Adopted Values The value adopted for b 
R's Adopted Numeric Values Adopted values for c 
Number of positive divisors 
Sum of positive "even divisors" 
Sum of positive "odd divisors" 
Sum of positive divisors 
Composite numbers   (P^a)(Q^b)(R^c)
R(2024).07/15(Mon)_Ver.001
Digit setting: 50 digits.
Fixed digit count.
Real number calculation mode.

No customer feedback for this calculation yet.