Base | Representation |
---|---|
bin | 11101010000001001110… |
… | …110101000001111001001 |
3 | 21010011200222210002201201 |
4 | 131100021312220033021 |
5 | 230413402230310212 |
6 | 4135251104544201 |
7 | 265142610105154 |
oct | 35201166501711 |
9 | 7104628702651 |
10 | 2010210010057 |
11 | 705586165527 |
12 | 285713322061 |
13 | 11773c902142 |
14 | 6d41a87cc9b |
15 | 37454520b57 |
hex | 1d409da83c9 |
2010210010057 has 2 divisors, whose sum is σ = 2010210010058. Its totient is φ = 2010210010056.
The previous prime is 2010210010021. The next prime is 2010210010097. The reversal of 2010210010057 is 7500100120102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1141341808896 + 868868201161 = 1068336^2 + 932131^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010210010057 - 215 = 2010209977289 is a prime.
It is a super-2 number, since 2×20102100100572 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2010210010097) 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, 1005105005028 + 1005105005029.
It is an arithmetic number, because the mean of its divisors is an integer number (1005105005029).
Almost surely, 22010210010057 is an apocalyptic number.
It is an amenable number.
2010210010057 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010210010057 is an equidigital number, since it uses as much as digits as its factorization.
2010210010057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 140, while the sum is 19.
Adding to 2010210010057 its reverse (7500100120102), we get a palindrome (9510310130159).
The spelling of 2010210010057 in words is "two trillion, ten billion, two hundred ten million, ten thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •