Base | Representation |
---|---|
bin | 101101011110100011101100… |
… | …110111111101000010000011 |
3 | 222020011221221221200201210112 |
4 | 231132203230313331002003 |
5 | 202203444044322143021 |
6 | 1545220125513421535 |
7 | 60062251043251262 |
oct | 5536435467750203 |
9 | 866157857621715 |
10 | 200012011131011 |
11 | 58803687a87902 |
12 | 1a523801a0a8ab |
13 | 877b08981ccb1 |
14 | 37568c0cdc5d9 |
15 | 181cb887acd5b |
hex | b5e8ecdfd083 |
200012011131011 has 4 divisors (see below), whose sum is σ = 200012065396224. Its totient is φ = 200011956865800.
The previous prime is 200012011130929. The next prime is 200012011131167. The reversal of 200012011131011 is 110131110210002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200012011131011 - 238 = 199737133224067 is a prime.
It is a super-3 number, since 3×2000120111310113 (a number of 44 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200012011131311) 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, 21166595 + ... + 29121276.
It is an arithmetic number, because the mean of its divisors is an integer number (50003016349056).
Almost surely, 2200012011131011 is an apocalyptic number.
200012011131011 is a deficient number, since it is larger than the sum of its proper divisors (54265213).
200012011131011 is an equidigital number, since it uses as much as digits as its factorization.
200012011131011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54265212.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 200012011131011 its reverse (110131110210002), we get a palindrome (310143121341013).
The spelling of 200012011131011 in words is "two hundred trillion, twelve billion, eleven million, one hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •