Base | Representation |
---|---|
bin | 101101100001011100010001… |
… | …111110001010000111001001 |
3 | 222020212220112012210112220011 |
4 | 231201130101332022013021 |
5 | 202220220443203310212 |
6 | 1545451144100031521 |
7 | 60112465306032211 |
oct | 5541342176120711 |
9 | 866786465715804 |
10 | 200210202010057 |
11 | 5887a740624718 |
12 | 1a5560b36925a1 |
13 | 87939830a76a5 |
14 | 3762322a11241 |
15 | 1822dd7ec64a7 |
hex | b61711f8a1c9 |
200210202010057 has 2 divisors, whose sum is σ = 200210202010058. Its totient is φ = 200210202010056.
The previous prime is 200210202009991. The next prime is 200210202010067. The reversal of 200210202010057 is 750010202012002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103443219855616 + 96766982154441 = 10170704^2 + 9837021^2 .
It is a cyclic number.
It is not a de Polignac number, because 200210202010057 - 27 = 200210202009929 is a prime.
It is not a weakly prime, because it can be changed into another prime (200210202010067) 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 as a sum of consecutive naturals, namely, 100105101005028 + 100105101005029.
It is an arithmetic number, because the mean of its divisors is an integer number (100105101005029).
Almost surely, 2200210202010057 is an apocalyptic number.
It is an amenable number.
200210202010057 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210202010057 is an equidigital number, since it uses as much as digits as its factorization.
200210202010057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 22.
Adding to 200210202010057 its reverse (750010202012002), we get a palindrome (950220404022059).
The spelling of 200210202010057 in words is "two hundred trillion, two hundred ten billion, two hundred two million, ten thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •