Base | Representation |
---|---|
bin | 101101011111111111111111… |
… | …101000100011111100100011 |
3 | 222020112102202022220111222010 |
4 | 231133333333220203330203 |
5 | 202212110023142023021 |
6 | 1545333435212444003 |
7 | 60102356566552311 |
oct | 5537777750437443 |
9 | 866472668814863 |
10 | 200111110111011 |
11 | 58841710854280 |
12 | 1a53aa59a79603 |
13 | 87875207699b8 |
14 | 375b6024190b1 |
15 | 1820538868976 |
hex | b5ffffa23f23 |
200111110111011 has 16 divisors (see below), whose sum is σ = 293952593795328. Its totient is φ = 120078673932000.
The previous prime is 200111110110937. The next prime is 200111110111013. The reversal of 200111110111011 is 110111011111002.
It is not a de Polignac number, because 200111110111011 - 214 = 200111110094627 is a prime.
It is a super-2 number, since 2×2001111101110112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (200111110111013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30019665151 + ... + 30019671816.
It is an arithmetic number, because the mean of its divisors is an integer number (18372037112208).
Almost surely, 2200111110111011 is an apocalyptic number.
200111110111011 is a deficient number, since it is larger than the sum of its proper divisors (93841483684317).
200111110111011 is a wasteful number, since it uses less digits than its factorization.
200111110111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60039337082.
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 200111110111011 its reverse (110111011111002), we get a palindrome (310222121222013).
Subtracting from 200111110111011 its reverse (110111011111002), we obtain a palindrome (90000099000009).
The spelling of 200111110111011 in words is "two hundred trillion, one hundred eleven billion, one hundred ten million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •