Base | Representation |
---|---|
bin | 1011101101010001010… |
… | …1111000100010011101 |
3 | 201020011011110112120212 |
4 | 2323110111320202131 |
5 | 11243404014031023 |
6 | 232222011222205 |
7 | 20350133210654 |
oct | 2732425704235 |
9 | 636134415525 |
10 | 201131002013 |
11 | 78332230807 |
12 | 32b92447965 |
13 | 15c74735c36 |
14 | 9a403b019b |
15 | 53728d0e78 |
hex | 2ed457889d |
201131002013 has 2 divisors, whose sum is σ = 201131002014. Its totient is φ = 201131002012.
The previous prime is 201131001977. The next prime is 201131002027. The reversal of 201131002013 is 310200131102.
It is an a-pointer prime, because the next prime (201131002027) can be obtained adding 201131002013 to its sum of digits (14).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 172421766169 + 28709235844 = 415237^2 + 169438^2 .
It is a cyclic number.
It is not a de Polignac number, because 201131002013 - 210 = 201131000989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201131002063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100565501006 + 100565501007.
It is an arithmetic number, because the mean of its divisors is an integer number (100565501007).
Almost surely, 2201131002013 is an apocalyptic number.
It is an amenable number.
201131002013 is a deficient number, since it is larger than the sum of its proper divisors (1).
201131002013 is an equidigital number, since it uses as much as digits as its factorization.
201131002013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 201131002013 its reverse (310200131102), we get a palindrome (511331133115).
The spelling of 201131002013 in words is "two hundred one billion, one hundred thirty-one million, two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •