Base | Representation |
---|---|
bin | 101101011110100010000000… |
… | …111011110101111001000011 |
3 | 222020011210021202010110120102 |
4 | 231132202000323311321003 |
5 | 202203431342223223021 |
6 | 1545215230103233015 |
7 | 60062155133553161 |
oct | 5536420073657103 |
9 | 866153252113512 |
10 | 200010200211011 |
11 | 58802938844903 |
12 | 1a52339744876b |
13 | 877ab5b5a86b8 |
14 | 375678c5c2231 |
15 | 181cace7e900b |
hex | b5e880ef5e43 |
200010200211011 has 2 divisors, whose sum is σ = 200010200211012. Its totient is φ = 200010200211010.
The previous prime is 200010200210993. The next prime is 200010200211109. The reversal of 200010200211011 is 110112002010002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200010200211011 - 234 = 199993020341827 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200010200210983 and 200010200211001.
It is not a weakly prime, because it can be changed into another prime (200010200211911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100005100105505 + 100005100105506.
It is an arithmetic number, because the mean of its divisors is an integer number (100005100105506).
Almost surely, 2200010200211011 is an apocalyptic number.
200010200211011 is a deficient number, since it is larger than the sum of its proper divisors (1).
200010200211011 is an equidigital number, since it uses as much as digits as its factorization.
200010200211011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200010200211011 its reverse (110112002010002), we get a palindrome (310122202221013).
The spelling of 200010200211011 in words is "two hundred trillion, ten billion, two hundred million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •