Base | Representation |
---|---|
bin | 11101010000000011111… |
… | …001100101010000110011 |
3 | 21010011110000211012201102 |
4 | 131100003321211100303 |
5 | 230413201142333021 |
6 | 4135233135555015 |
7 | 265140255054356 |
oct | 35200371452063 |
9 | 7104400735642 |
10 | 2010110121011 |
11 | 70553483a3a3 |
12 | 2856a598ba6b |
13 | 117724cc9cb5 |
14 | 6d40b4ba29d |
15 | 3744a88e00b |
hex | 1d403e65433 |
2010110121011 has 2 divisors, whose sum is σ = 2010110121012. Its totient is φ = 2010110121010.
The previous prime is 2010110121001. The next prime is 2010110121023. The reversal of 2010110121011 is 1101210110102.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2010110121011 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 2010110120983 and 2010110121001.
It is not a weakly prime, because it can be changed into another prime (2010110121001) 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 as a sum of consecutive naturals, namely, 1005055060505 + 1005055060506.
It is an arithmetic number, because the mean of its divisors is an integer number (1005055060506).
Almost surely, 22010110121011 is an apocalyptic number.
2010110121011 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010110121011 is an equidigital number, since it uses as much as digits as its factorization.
2010110121011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2010110121011 its reverse (1101210110102), we get a palindrome (3111320231113).
The spelling of 2010110121011 in words is "two trillion, ten billion, one hundred ten million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •