Base | Representation |
---|---|
bin | 111101000010… |
… | …0100001110001 |
3 | 2020012202220101 |
4 | 1322010201301 |
5 | 31143000423 |
6 | 3101512401 |
7 | 535665535 |
oct | 172044161 |
9 | 66182811 |
10 | 32000113 |
11 | 17077182 |
12 | a872701 |
13 | 68254a2 |
14 | 436dbc5 |
15 | 2c217ad |
hex | 1e84871 |
32000113 has 2 divisors, whose sum is σ = 32000114. Its totient is φ = 32000112.
The previous prime is 32000093. The next prime is 32000119. The reversal of 32000113 is 31100023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25482304 + 6517809 = 5048^2 + 2553^2 .
It is an emirp because it is prime and its reverse (31100023) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32000113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 32000113.
It is not a weakly prime, because it can be changed into another prime (32000119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16000056 + 16000057.
It is an arithmetic number, because the mean of its divisors is an integer number (16000057).
Almost surely, 232000113 is an apocalyptic number.
It is an amenable number.
32000113 is a deficient number, since it is larger than the sum of its proper divisors (1).
32000113 is an equidigital number, since it uses as much as digits as its factorization.
32000113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 10.
The square root of 32000113 is about 5656.8642373668. The cubic root of 32000113 is about 317.4805840939.
Adding to 32000113 its reverse (31100023), we get a palindrome (63100136).
The spelling of 32000113 in words is "thirty-two million, one hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.190 sec. • engine limits •