Base | Representation |
---|---|
bin | 101101011110100010110001… |
… | …001100111110111110000011 |
3 | 222020011212101011220120100000 |
4 | 231132202301030332332003 |
5 | 202203440022030323021 |
6 | 1545215442312131043 |
7 | 60062214166004133 |
oct | 5536426114767603 |
9 | 866155334816300 |
10 | 200011010011011 |
11 | 58803213969601 |
12 | 1a523582696a83 |
13 | 877ac5a2b00b4 |
14 | 3756827d7cac3 |
15 | 181cb2a959b26 |
hex | b5e8b133ef83 |
200011010011011 has 24 divisors (see below), whose sum is σ = 299625693128944. Its totient is φ = 133331450289120.
The previous prime is 200011010010997. The next prime is 200011010011019. The reversal of 200011010011011 is 110110010110002.
It is not a de Polignac number, because 200011010011011 - 27 = 200011010010883 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200011010010984 and 200011010011002.
It is not an unprimeable number, because it can be changed into a prime (200011010011019) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 24944956 + ... + 31973001.
Almost surely, 2200011010011011 is an apocalyptic number.
200011010011011 is a deficient number, since it is larger than the sum of its proper divisors (99614683117933).
200011010011011 is an equidigital number, since it uses as much as digits as its factorization.
200011010011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56932433 (or 56932421 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 200011010011011 its reverse (110110010110002), we get a palindrome (310121020121013).
The spelling of 200011010011011 in words is "two hundred trillion, eleven billion, ten million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •