Base | Representation |
---|---|
bin | 11101000110101010100… |
… | …011000100010110010011 |
3 | 21002012101220120110110211 |
4 | 131012222203010112103 |
5 | 230232020401042321 |
6 | 4130444053304551 |
7 | 264332246645503 |
oct | 35065243042623 |
9 | 7065356513424 |
10 | 2000021112211 |
11 | 7012278607a1 |
12 | 28374b035157 |
13 | 1167a7a46ac5 |
14 | 6cb315c7a03 |
15 | 37059c9d0e1 |
hex | 1d1aa8c4593 |
2000021112211 has 4 divisors (see below), whose sum is σ = 2000024176024. Its totient is φ = 2000018048400.
The previous prime is 2000021112137. The next prime is 2000021112239. The reversal of 2000021112211 is 1122111200002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2000021112211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000021112191 and 2000021112200.
It is not an unprimeable number, because it can be changed into a prime (2000021112251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 117285 + ... + 2003446.
It is an arithmetic number, because the mean of its divisors is an integer number (500006044006).
Almost surely, 22000021112211 is an apocalyptic number.
2000021112211 is a deficient number, since it is larger than the sum of its proper divisors (3063813).
2000021112211 is an equidigital number, since it uses as much as digits as its factorization.
2000021112211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3063812.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2000021112211 its reverse (1122111200002), we get a palindrome (3122132312213).
The spelling of 2000021112211 in words is "two trillion, twenty-one million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •