Base | Representation |
---|---|
bin | 11101010001111011001… |
… | …011000101111100001011 |
3 | 21010100121111012120001110 |
4 | 131101323023011330023 |
5 | 230431300431400021 |
6 | 4140203502021403 |
7 | 265240664002053 |
oct | 35217313057413 |
9 | 7110544176043 |
10 | 2012111200011 |
11 | 7063713536a0 |
12 | 285b63b77863 |
13 | 117983761503 |
14 | 6d55b176563 |
15 | 375163b6476 |
hex | 1d47b2c5f0b |
2012111200011 has 16 divisors (see below), whose sum is σ = 2949048482688. Its totient is φ = 1210152465600.
The previous prime is 2012111199997. The next prime is 2012111200013. The reversal of 2012111200011 is 1100021112102.
It is not a de Polignac number, because 2012111200011 - 213 = 2012111191819 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2012111200011.
It is not an unprimeable number, because it can be changed into a prime (2012111200013) 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 15 ways as a sum of consecutive naturals, for example, 232717306 + ... + 232725951.
It is an arithmetic number, because the mean of its divisors is an integer number (184315530168).
Almost surely, 22012111200011 is an apocalyptic number.
2012111200011 is a deficient number, since it is larger than the sum of its proper divisors (936937282677).
2012111200011 is a wasteful number, since it uses less digits than its factorization.
2012111200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465443402.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2012111200011 its reverse (1100021112102), we get a palindrome (3112132312113).
It can be divided in two parts, 2012111 and 200011, that added together give a palindrome (2212122).
The spelling of 2012111200011 in words is "two trillion, twelve billion, one hundred eleven million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •