Base | Representation |
---|---|
bin | 1011101101010001001… |
… | …0001011100001001111 |
3 | 201020011002122012212012 |
4 | 2323110102023201033 |
5 | 11243403241444213 |
6 | 232221534331435 |
7 | 20350122025364 |
oct | 2732422134117 |
9 | 636132565765 |
10 | 201130031183 |
11 | 78331728374 |
12 | 32b92059b7b |
13 | 15c74486093 |
14 | 9a401da46b |
15 | 537278d4a8 |
hex | 2ed448b84f |
201130031183 has 2 divisors, whose sum is σ = 201130031184. Its totient is φ = 201130031182.
The previous prime is 201130031177. The next prime is 201130031189. The reversal of 201130031183 is 381130031102.
201130031183 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (201130031177) and next prime (201130031189).
It is a cyclic number.
It is not a de Polignac number, because 201130031183 - 218 = 201129769039 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201130031189) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100565015591 + 100565015592.
It is an arithmetic number, because the mean of its divisors is an integer number (100565015592).
Almost surely, 2201130031183 is an apocalyptic number.
201130031183 is a deficient number, since it is larger than the sum of its proper divisors (1).
201130031183 is an equidigital number, since it uses as much as digits as its factorization.
201130031183 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 201130031183 its reverse (381130031102), we get a palindrome (582260062285).
The spelling of 201130031183 in words is "two hundred one billion, one hundred thirty million, thirty-one thousand, one hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •