Base | Representation |
---|---|
bin | 11101111001100100… |
… | …101110010010110101 |
3 | 10001212102011120201212 |
4 | 131321210232102311 |
5 | 1011222214103023 |
6 | 22425405331205 |
7 | 2214402150251 |
oct | 357144562265 |
9 | 101772146655 |
10 | 32104441013 |
11 | 12685135787 |
12 | 627b866b05 |
13 | 3048379478 |
14 | 17a7b2d261 |
15 | c7d76be78 |
hex | 77992e4b5 |
32104441013 has 4 divisors (see below), whose sum is σ = 32107858188. Its totient is φ = 32101023840.
The previous prime is 32104441007. The next prime is 32104441021. The reversal of 32104441013 is 31014440123.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 21708191569 + 10396249444 = 147337^2 + 101962^2 .
It is a cyclic number.
It is not a de Polignac number, because 32104441013 - 24 = 32104440997 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 32104441013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32104444013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1694456 + ... + 1713297.
It is an arithmetic number, because the mean of its divisors is an integer number (8026964547).
Almost surely, 232104441013 is an apocalyptic number.
It is an amenable number.
32104441013 is a deficient number, since it is larger than the sum of its proper divisors (3417175).
32104441013 is an equidigital number, since it uses as much as digits as its factorization.
32104441013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3417174.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 32104441013 its reverse (31014440123), we get a palindrome (63118881136).
The spelling of 32104441013 in words is "thirty-two billion, one hundred four million, four hundred forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •