Base | Representation |
---|---|
bin | 1011101101111010011… |
… | …0000111110011100011 |
3 | 201020121011011112000020 |
4 | 2323132212013303203 |
5 | 11244232033443021 |
6 | 232251034324523 |
7 | 20354322350145 |
oct | 2733646076343 |
9 | 636534145006 |
10 | 201303031011 |
11 | 78410349735 |
12 | 3301bb89743 |
13 | 15ca1278944 |
14 | 9a59190c95 |
15 | 5382a627c6 |
hex | 2ede987ce3 |
201303031011 has 48 divisors (see below), whose sum is σ = 290076140160. Its totient is φ = 123827598720.
The previous prime is 201303031003. The next prime is 201303031019. The reversal of 201303031011 is 110130303102.
It is an interprime number because it is at equal distance from previous prime (201303031003) and next prime (201303031019).
It is not a de Polignac number, because 201303031011 - 23 = 201303031003 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201303031019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 26563855 + ... + 26571431.
It is an arithmetic number, because the mean of its divisors is an integer number (6043252920).
Almost surely, 2201303031011 is an apocalyptic number.
201303031011 is a deficient number, since it is larger than the sum of its proper divisors (88773109149).
201303031011 is a wasteful number, since it uses less digits than its factorization.
201303031011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7904 (or 7857 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 201303031011 its reverse (110130303102), we get a palindrome (311433334113).
It can be divided in two parts, 20130303101 and 1, that added together give a palindrome (20130303102).
The spelling of 201303031011 in words is "two hundred one billion, three hundred three million, thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •