Base | Representation |
---|---|
bin | 11101000111101010111… |
… | …010100001000110010111 |
3 | 21002022012011120111120000 |
4 | 131013222322201012113 |
5 | 230241223324013421 |
6 | 4131143151142343 |
7 | 264401101600602 |
oct | 35075272410627 |
9 | 7068164514500 |
10 | 2001101001111 |
11 | 70173138a263 |
12 | 2839b08149b3 |
13 | 11691a6a5914 |
14 | 6cbd4bad339 |
15 | 370be9b0226 |
hex | 1d1eaea1197 |
2001101001111 has 20 divisors (see below), whose sum is σ = 2993714616552. Its totient is φ = 1332096740208.
The previous prime is 2001101001103. The next prime is 2001101001143. The reversal of 2001101001111 is 1111001011002.
It is not a de Polignac number, because 2001101001111 - 23 = 2001101001103 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 = 2001101001093 and 2001101001102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001101001311) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 18191065 + ... + 18300738.
Almost surely, 22001101001111 is an apocalyptic number.
2001101001111 is a deficient number, since it is larger than the sum of its proper divisors (992613615441).
2001101001111 is an equidigital number, since it uses as much as digits as its factorization.
2001101001111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36492492 (or 36492483 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 2001101001111 its reverse (1111001011002), we get a palindrome (3112102012113).
The spelling of 2001101001111 in words is "two trillion, one billion, one hundred one million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •