Base | Representation |
---|---|
bin | 11101010001111011001… |
… | …010110010011011100101 |
3 | 21010100121111001111102211 |
4 | 131101323022302123211 |
5 | 230431300421320401 |
6 | 4140203500203421 |
7 | 265240663220065 |
oct | 35217312623345 |
9 | 7110544044384 |
10 | 2012111120101 |
11 | 7063712a9655 |
12 | 285b63b39571 |
13 | 117983734024 |
14 | 6d55b1553a5 |
15 | 3751639c951 |
hex | 1d47b2b26e5 |
2012111120101 has 8 divisors (see below), whose sum is σ = 2146733734464. Its totient is φ = 1879295520960.
The previous prime is 2012111120093. The next prime is 2012111120147. The reversal of 2012111120101 is 1010211112102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2012111120101 - 23 = 2012111120093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012111121101) 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 7 ways as a sum of consecutive naturals, for example, 451751505 + ... + 451755958.
It is an arithmetic number, because the mean of its divisors is an integer number (268341716808).
Almost surely, 22012111120101 is an apocalyptic number.
It is an amenable number.
2012111120101 is a deficient number, since it is larger than the sum of its proper divisors (134622614363).
2012111120101 is a wasteful number, since it uses less digits than its factorization.
2012111120101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 903507611.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 2012111120101 its reverse (1010211112102), we get a palindrome (3022322232203).
The spelling of 2012111120101 in words is "two trillion, twelve billion, one hundred eleven million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •