Base | Representation |
---|---|
bin | 101101011111111111111010… |
… | …010101000000101111101011 |
3 | 222020112102112010102021211102 |
4 | 231133333322111000233223 |
5 | 202212104332400200021 |
6 | 1545333422312552015 |
7 | 60102354436146110 |
oct | 5537777225005753 |
9 | 866472463367742 |
10 | 200111021100011 |
11 | 58841675588a6a |
12 | 1a53aa340b260b |
13 | 87875081a2c78 |
14 | 375b5d4688907 |
15 | 1820530b3500b |
hex | b5fffa540beb |
200111021100011 has 16 divisors (see below), whose sum is σ = 228927339979008. Its totient is φ = 171351976068000.
The previous prime is 200111021099989. The next prime is 200111021100013. The reversal of 200111021100011 is 110001120111002.
It is not a de Polignac number, because 200111021100011 - 210 = 200111021098987 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200111021099965 and 200111021100001.
It is not an unprimeable number, because it can be changed into a prime (200111021100013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 148921016 + ... + 150258746.
It is an arithmetic number, because the mean of its divisors is an integer number (14307958748688).
Almost surely, 2200111021100011 is an apocalyptic number.
200111021100011 is a deficient number, since it is larger than the sum of its proper divisors (28816318878997).
200111021100011 is a wasteful number, since it uses less digits than its factorization.
200111021100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1359122.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 200111021100011 its reverse (110001120111002), we get a palindrome (310112141211013).
The spelling of 200111021100011 in words is "two hundred trillion, one hundred eleven billion, twenty-one million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •