Base | Representation |
---|---|
bin | 101101011110100010110111… |
… | …001110101001011001000011 |
3 | 222020011212122020010221100211 |
4 | 231132202313032221121003 |
5 | 202203440223421011321 |
6 | 1545215500323054551 |
7 | 60062216534225032 |
oct | 5536426716513103 |
9 | 866155566127324 |
10 | 200011111110211 |
11 | 58803265a40965 |
12 | 1a5235b0511457 |
13 | 877ac75219ccb |
14 | 3756837578719 |
15 | 181cb3477a0e1 |
hex | b5e8b73a9643 |
200011111110211 has 8 divisors (see below), whose sum is σ = 200277824664384. Its totient is φ = 199744404148800.
The previous prime is 200011111110191. The next prime is 200011111110253. The reversal of 200011111110211 is 112011111110002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200011111110211 - 211 = 200011111108163 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200011111110191 and 200011111110200.
It is not an unprimeable number, because it can be changed into a prime (200011111110281) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60636111 + ... + 63849511.
It is an arithmetic number, because the mean of its divisors is an integer number (25034728083048).
Almost surely, 2200011111110211 is an apocalyptic number.
200011111110211 is a deficient number, since it is larger than the sum of its proper divisors (266713554173).
200011111110211 is an equidigital number, since it uses as much as digits as its factorization.
200011111110211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3296381.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 200011111110211 its reverse (112011111110002), we get a palindrome (312022222220213).
The spelling of 200011111110211 in words is "two hundred trillion, eleven billion, one hundred eleven million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •