Base | Representation |
---|---|
bin | 11101011001010010000… |
… | …010110100011101101011 |
3 | 21011010000001021001120100 |
4 | 131121102002310131223 |
5 | 231043440320200021 |
6 | 4143551424200443 |
7 | 265640521022352 |
oct | 35312202643553 |
9 | 7133001231510 |
10 | 2020011100011 |
11 | 709755671473 |
12 | 2875a9769123 |
13 | 118642327458 |
14 | 6daaa424999 |
15 | 37829bdc626 |
hex | 1d6520b476b |
2020011100011 has 6 divisors (see below), whose sum is σ = 2917793811140. Its totient is φ = 1346674066668.
The previous prime is 2020011099947. The next prime is 2020011100013. The reversal of 2020011100011 is 1100011100202.
It is a happy number.
It is not a de Polignac number, because 2020011100011 - 26 = 2020011099947 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 224445677779 = 2020011100011 / (2 + 0 + 2 + 0 + 0 + 1 + 1 + 1 + 0 + 0 + 0 + 1 + 1).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2020011099966 and 2020011100002.
It is not an unprimeable number, because it can be changed into a prime (2020011100013) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 112222838881 + ... + 112222838898.
Almost surely, 22020011100011 is an apocalyptic number.
2020011100011 is a deficient number, since it is larger than the sum of its proper divisors (897782711129).
2020011100011 is a wasteful number, since it uses less digits than its factorization.
2020011100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224445677785 (or 224445677782 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2020011100011 its reverse (1100011100202), we get a palindrome (3120022200213).
The spelling of 2020011100011 in words is "two trillion, twenty billion, eleven million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •