Base | Representation |
---|---|
bin | 101101011110100001110101… |
… | …101010011100011101010011 |
3 | 222020011202210120021200102100 |
4 | 231132201311222130131103 |
5 | 202203431000320213021 |
6 | 1545215155230051443 |
7 | 60062150346263106 |
oct | 5536416552343523 |
9 | 866152716250370 |
10 | 200010011101011 |
11 | 5880285101a751 |
12 | 1a523344049b83 |
13 | 877ab2b3650a7 |
14 | 375677143673d |
15 | 181cabcde1626 |
hex | b5e875a9c753 |
200010011101011 has 12 divisors (see below), whose sum is σ = 296711548000192. Its totient is φ = 129736223416656.
The previous prime is 200010011101009. The next prime is 200010011101031. The reversal of 200010011101011 is 110101110010002.
It is not a de Polignac number, because 200010011101011 - 21 = 200010011101009 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 = 200010011100984 and 200010011101002.
It is not an unprimeable number, because it can be changed into a prime (200010011101031) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 300315331651 + ... + 300315332316.
Almost surely, 2200010011101011 is an apocalyptic number.
200010011101011 is a deficient number, since it is larger than the sum of its proper divisors (96701536899181).
200010011101011 is a wasteful number, since it uses less digits than its factorization.
200010011101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600630664010 (or 600630664007 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 200010011101011 its reverse (110101110010002), we get a palindrome (310111121111013).
The spelling of 200010011101011 in words is "two hundred trillion, ten billion, eleven million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •