Base | Representation |
---|---|
bin | 11101001111111101111… |
… | …111110110101100000101 |
3 | 21010011012010111112010001 |
4 | 131033331333312230011 |
5 | 230413000320230312 |
6 | 4135215241401301 |
7 | 265134643316155 |
oct | 35177577665405 |
9 | 7104163445101 |
10 | 2010011101957 |
11 | 705493958971 |
12 | 285678799231 |
13 | 11770a63ab41 |
14 | 6d3dc2a2765 |
15 | 37441d30057 |
hex | 1d3fdff6b05 |
2010011101957 has 2 divisors, whose sum is σ = 2010011101958. Its totient is φ = 2010011101956.
The previous prime is 2010011101927. The next prime is 2010011101997. The reversal of 2010011101957 is 7591011100102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1049079868516 + 960931233441 = 1024246^2 + 980271^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2010011101957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2010011101927) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005005550978 + 1005005550979.
It is an arithmetic number, because the mean of its divisors is an integer number (1005005550979).
Almost surely, 22010011101957 is an apocalyptic number.
It is an amenable number.
2010011101957 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010011101957 is an equidigital number, since it uses as much as digits as its factorization.
2010011101957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 630, while the sum is 28.
The spelling of 2010011101957 in words is "two trillion, ten billion, eleven million, one hundred one thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •