Base | Representation |
---|---|
bin | 11101000111101011100… |
… | …000101010011110110011 |
3 | 21002022012212101112211200 |
4 | 131013223200222132303 |
5 | 230241233404013021 |
6 | 4131144145342243 |
7 | 264401252600043 |
oct | 35075340523663 |
9 | 7068185345750 |
10 | 2001111001011 |
11 | 701736a9a341 |
12 | 2839b4037983 |
13 | 11691c797415 |
14 | 6cbd6253723 |
15 | 370c07d8126 |
hex | 1d1eb82a7b3 |
2001111001011 has 12 divisors (see below), whose sum is σ = 2905166227392. Its totient is φ = 1327302050256.
The previous prime is 2001111001003. The next prime is 2001111001081. The reversal of 2001111001011 is 1101001111002.
It is not a de Polignac number, because 2001111001011 - 23 = 2001111001003 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2001111000984 and 2001111001002.
It is not an unprimeable number, because it can be changed into a prime (2001111001081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 564327331 + ... + 564330876.
It is an arithmetic number, because the mean of its divisors is an integer number (242097185616).
Almost surely, 22001111001011 is an apocalyptic number.
2001111001011 is a deficient number, since it is larger than the sum of its proper divisors (904055226381).
2001111001011 is a wasteful number, since it uses less digits than its factorization.
2001111001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1128658410 (or 1128658407 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 2001111001011 its reverse (1101001111002), we get a palindrome (3102112112013).
The spelling of 2001111001011 in words is "two trillion, one billion, one hundred eleven million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •