Base | Representation |
---|---|
bin | 11101000111101010110… |
… | …111110111001100111011 |
3 | 21002022012010021010221221 |
4 | 131013222313313030323 |
5 | 230241223134231321 |
6 | 4131143124212511 |
7 | 264401062642000 |
oct | 35075267671473 |
9 | 7068163233857 |
10 | 2001100305211 |
11 | 701730a54437 |
12 | 2839b053a137 |
13 | 11691a4c0c47 |
14 | 6cbd4a6b8a7 |
15 | 370be8c3e41 |
hex | 1d1eadf733b |
2001100305211 has 16 divisors (see below), whose sum is σ = 2366512934400. Its totient is φ = 1691070659880.
The previous prime is 2001100305199. The next prime is 2001100305223. The reversal of 2001100305211 is 1125030011002.
It is an interprime number because it is at equal distance from previous prime (2001100305199) and next prime (2001100305223).
It is a de Polignac number, because none of the positive numbers 2k-2001100305211 is a prime.
It is a super-4 number, since 4×20011003052114 (a number of 50 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2001100305251) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41060941 + ... + 41109646.
It is an arithmetic number, because the mean of its divisors is an integer number (147907058400).
Almost surely, 22001100305211 is an apocalyptic number.
2001100305211 is a deficient number, since it is larger than the sum of its proper divisors (365412629189).
2001100305211 is an frugal number, since it uses more digits than its factorization.
2001100305211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82170679 (or 82170665 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 16.
Adding to 2001100305211 its reverse (1125030011002), we get a palindrome (3126130316213).
The spelling of 2001100305211 in words is "two trillion, one billion, one hundred million, three hundred five thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •