Base | Representation |
---|---|
bin | 11101000110101111111… |
… | …001111101111001111011 |
3 | 21002012122011201022000001 |
4 | 131012233321331321323 |
5 | 230232211404014321 |
6 | 4130501024053431 |
7 | 264334420666531 |
oct | 35065771757173 |
9 | 7065564638001 |
10 | 2000111001211 |
11 | 701273576724 |
12 | 283775164277 |
13 | 1167c055a36b |
14 | 6cb3d506151 |
15 | 37062b06c91 |
hex | 1d1afe7de7b |
2000111001211 has 8 divisors (see below), whose sum is σ = 2000716588800. Its totient is φ = 1999505517288.
The previous prime is 2000111001193. The next prime is 2000111001271. The reversal of 2000111001211 is 1121001110002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2000111001211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2000111001271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54204210 + ... + 54241096.
It is an arithmetic number, because the mean of its divisors is an integer number (250089573600).
Almost surely, 22000111001211 is an apocalyptic number.
2000111001211 is a deficient number, since it is larger than the sum of its proper divisors (605587589).
2000111001211 is an equidigital number, since it uses as much as digits as its factorization.
2000111001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51833.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 2000111001211 its reverse (1121001110002), we get a palindrome (3121112111213).
The spelling of 2000111001211 in words is "two trillion, one hundred eleven million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •