Base | Representation |
---|---|
bin | 1001000110001000101001… |
… | …10001000011100000011011 |
3 | 2121211011200112201000212210 |
4 | 10203010110301003200123 |
5 | 10110203104320214321 |
6 | 110312444055010203 |
7 | 4133045324060466 |
oct | 443042461034033 |
9 | 77734615630783 |
10 | 20002011101211 |
11 | 64118948a7157 |
12 | 22b0635069963 |
13 | b21248b46c59 |
14 | 4d21613a62dd |
15 | 24a4716dcb76 |
hex | 123114c4381b |
20002011101211 has 4 divisors (see below), whose sum is σ = 26669348134952. Its totient is φ = 13334674067472.
The previous prime is 20002011101167. The next prime is 20002011101221. The reversal of 20002011101211 is 11210111020002.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 20002011101211 - 213 = 20002011093019 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20002011101221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3333668516866 + ... + 3333668516871.
It is an arithmetic number, because the mean of its divisors is an integer number (6667337033738).
Almost surely, 220002011101211 is an apocalyptic number.
20002011101211 is a deficient number, since it is larger than the sum of its proper divisors (6667337033741).
20002011101211 is an equidigital number, since it uses as much as digits as its factorization.
20002011101211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6667337033740.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 20002011101211 its reverse (11210111020002), we get a palindrome (31212122121213).
The spelling of 20002011101211 in words is "twenty trillion, two billion, eleven million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •