Base | Representation |
---|---|
bin | 11101001000100111000… |
… | …100010110001111000011 |
3 | 21002101210111120200021110 |
4 | 131020213010112033003 |
5 | 230300310203223021 |
6 | 4131431242054403 |
7 | 264435105000531 |
oct | 35104704261703 |
9 | 7071714520243 |
10 | 2002110211011 |
11 | 7020aa023629 |
12 | 2840327aa403 |
13 | 116a4b7b8b41 |
14 | 6cc8cc37151 |
15 | 3712d3b0476 |
hex | 1d2271163c3 |
2002110211011 has 32 divisors (see below), whose sum is σ = 2829809323008. Its totient is φ = 1254759966720.
The previous prime is 2002110211001. The next prime is 2002110211021. The reversal of 2002110211011 is 1101120112002.
It is an interprime number because it is at equal distance from previous prime (2002110211001) and next prime (2002110211021).
It is not a de Polignac number, because 2002110211011 - 211 = 2002110208963 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2002110211001) 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 31 ways as a sum of consecutive naturals, for example, 174896890 + ... + 174908336.
It is an arithmetic number, because the mean of its divisors is an integer number (88431541344).
Almost surely, 22002110211011 is an apocalyptic number.
2002110211011 is a deficient number, since it is larger than the sum of its proper divisors (827699111997).
2002110211011 is a wasteful number, since it uses less digits than its factorization.
2002110211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15171.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2002110211011 its reverse (1101120112002), we get a palindrome (3103230323013).
Subtracting from 2002110211011 its reverse (1101120112002), we obtain a palindrome (900990099009).
The spelling of 2002110211011 in words is "two trillion, two billion, one hundred ten million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •