Base | Representation |
---|---|
bin | 11101010010000111000… |
… | …010001110001100010111 |
3 | 21010101010100122212020120 |
4 | 131102013002032030113 |
5 | 230432202402413421 |
6 | 4140235331203023 |
7 | 265245631326150 |
oct | 35220702161427 |
9 | 7111110585216 |
10 | 2012310201111 |
11 | 706463714111 |
12 | 285bba746473 |
13 | 1179b5a58c42 |
14 | 6d579778927 |
15 | 37528ac48c6 |
hex | 1d48708e317 |
2012310201111 has 8 divisors (see below), whose sum is σ = 3066377449344. Its totient is φ = 1149891543480.
The previous prime is 2012310201107. The next prime is 2012310201137. The reversal of 2012310201111 is 1111020132102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2012310201111 - 22 = 2012310201107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012310200111) 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 7 ways as a sum of consecutive naturals, for example, 47912147625 + ... + 47912147666.
It is an arithmetic number, because the mean of its divisors is an integer number (383297181168).
Almost surely, 22012310201111 is an apocalyptic number.
2012310201111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2012310201111 is a deficient number, since it is larger than the sum of its proper divisors (1054067248233).
2012310201111 is an equidigital number, since it uses as much as digits as its factorization.
2012310201111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95824295301.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 2012310201111 its reverse (1111020132102), we get a palindrome (3123330333213).
The spelling of 2012310201111 in words is "two trillion, twelve billion, three hundred ten million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •