Base | Representation |
---|---|
bin | 11101010000000100000… |
… | …001001010110110111011 |
3 | 21010011110011120021010002 |
4 | 131100010001022312323 |
5 | 230413202200010021 |
6 | 4135233250343215 |
7 | 265140311010245 |
oct | 35200401126673 |
9 | 7104404507102 |
10 | 2010112110011 |
11 | 7055359787a5 |
12 | 2856a658ab0b |
13 | 117725545415 |
14 | 6d40b877095 |
15 | 3744ab3350b |
hex | 1d40404adbb |
2010112110011 has 8 divisors (see below), whose sum is σ = 2013207410448. Its totient is φ = 2007017460000.
The previous prime is 2010112109989. The next prime is 2010112110067. The reversal of 2010112110011 is 1100112110102.
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 2010112110011 - 222 = 2010107915707 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2010112109974 and 2010112110001.
It is not an unprimeable number, because it can be changed into a prime (2010112110311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6215081 + ... + 6530501.
It is an arithmetic number, because the mean of its divisors is an integer number (251650926306).
Almost surely, 22010112110011 is an apocalyptic number.
2010112110011 is a deficient number, since it is larger than the sum of its proper divisors (3095300437).
2010112110011 is an equidigital number, since it uses as much as digits as its factorization.
2010112110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 325213.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2010112110011 its reverse (1100112110102), we get a palindrome (3110224220113).
Subtracting from 2010112110011 its reverse (1100112110102), we obtain a palindrome (909999999909).
The spelling of 2010112110011 in words is "two trillion, ten billion, one hundred twelve million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •