Base | Representation |
---|---|
bin | 11101001000101101000… |
… | …101010100111010000011 |
3 | 21002102001112110221111020 |
4 | 131020231011110322003 |
5 | 230301012022143021 |
6 | 4131445245120523 |
7 | 264440441544120 |
oct | 35105505247203 |
9 | 7072045427436 |
10 | 2002211131011 |
11 | 702150a93293 |
12 | 284060559143 |
13 | 116a66692310 |
14 | 6cc9c3c7747 |
15 | 371371977c6 |
hex | 1d22d154e83 |
2002211131011 has 32 divisors (see below), whose sum is σ = 3288842618880. Its totient is φ = 1055094747264.
The previous prime is 2002211131007. The next prime is 2002211131013. The reversal of 2002211131011 is 1101311122002.
It is not a de Polignac number, because 2002211131011 - 22 = 2002211131007 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2002211131013) 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, 3245760 + ... + 3813053.
It is an arithmetic number, because the mean of its divisors is an integer number (102776331840).
Almost surely, 22002211131011 is an apocalyptic number.
2002211131011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2002211131011 is a deficient number, since it is larger than the sum of its proper divisors (1286631487869).
2002211131011 is a wasteful number, since it uses less digits than its factorization.
2002211131011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7059875.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 2002211131011 its reverse (1101311122002), we get a palindrome (3103522253013).
Subtracting from 2002211131011 its reverse (1101311122002), we obtain a palindrome (900900009009).
The spelling of 2002211131011 in words is "two trillion, two billion, two hundred eleven million, one hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •