Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110011100101100110111 |
3 | 222020212222120220102120202010 |
4 | 231201131001212130230313 |
5 | 202220224112240213421 |
6 | 1545451355243215303 |
7 | 60112524151141560 |
oct | 5541350146345467 |
9 | 866788526376663 |
10 | 200211001101111 |
11 | 588800106a4650 |
12 | 1a556297217533 |
13 | 8793a7c7cc930 |
14 | 376239abc1167 |
15 | 1822e3321e076 |
hex | b6174199cb37 |
200211001101111 has 64 divisors (see below), whose sum is σ = 359228770467840. Its totient is φ = 95788558419840.
The previous prime is 200211001101101. The next prime is 200211001101119. The reversal of 200211001101111 is 111101100112002.
It is not a de Polignac number, because 200211001101111 - 213 = 200211001092919 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200211001101119) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 73918351 + ... + 76579008.
It is an arithmetic number, because the mean of its divisors is an integer number (5612949538560).
Almost surely, 2200211001101111 is an apocalyptic number.
200211001101111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
200211001101111 is a deficient number, since it is larger than the sum of its proper divisors (159017769366729).
200211001101111 is a wasteful number, since it uses less digits than its factorization.
200211001101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150497836.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 200211001101111 its reverse (111101100112002), we get a palindrome (311312101213113).
The spelling of 200211001101111 in words is "two hundred trillion, two hundred eleven billion, one million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •