Base | Representation |
---|---|
bin | 101101011111111111001010… |
… | …000011011111011111110011 |
3 | 222020112100102200110011021011 |
4 | 231133333022003133133303 |
5 | 202212101203031413021 |
6 | 1545333210102011351 |
7 | 60102325403133406 |
oct | 5537771203373763 |
9 | 866470380404234 |
10 | 200110211201011 |
11 | 5884129a3a6951 |
12 | 1a53a848a16b57 |
13 | 87874094654a7 |
14 | 375b558ca3d3d |
15 | 18204d49a4de1 |
hex | b5ffca0df7f3 |
200110211201011 has 4 divisors (see below), whose sum is σ = 200112050710224. Its totient is φ = 200108371691800.
The previous prime is 200110211200979. The next prime is 200110211201039. The reversal of 200110211201011 is 110102112011002.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200110211201011 - 25 = 200110211200979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200110211200982 and 200110211201000.
It is not an unprimeable number, because it can be changed into a prime (200110211201611) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 919591420 + ... + 919809001.
It is an arithmetic number, because the mean of its divisors is an integer number (50028012677556).
Almost surely, 2200110211201011 is an apocalyptic number.
200110211201011 is a deficient number, since it is larger than the sum of its proper divisors (1839509213).
200110211201011 is a wasteful number, since it uses less digits than its factorization.
200110211201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1839509212.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 200110211201011 its reverse (110102112011002), we get a palindrome (310212323212013).
The spelling of 200110211201011 in words is "two hundred trillion, one hundred ten billion, two hundred eleven million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •