Base | Representation |
---|---|
bin | 1011101001011100000… |
… | …1010100001011111001 |
3 | 201010111110120222121201 |
4 | 2322113001110023321 |
5 | 11234302130400212 |
6 | 231531540334201 |
7 | 20312501431234 |
oct | 2722701241371 |
9 | 633443528551 |
10 | 200102200057 |
11 | 77954525661 |
12 | 329459a4361 |
13 | 15b3c553196 |
14 | 99838c641b |
15 | 5312410b57 |
hex | 2e970542f9 |
200102200057 has 2 divisors, whose sum is σ = 200102200058. Its totient is φ = 200102200056.
The previous prime is 200102200013. The next prime is 200102200099. The reversal of 200102200057 is 750002201002.
200102200057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 169331427001 + 30770773056 = 411499^2 + 175416^2 .
It is a cyclic number.
It is not a de Polignac number, because 200102200057 - 27 = 200102199929 is a prime.
It is not a weakly prime, because it can be changed into another prime (200102203057) 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, 100051100028 + 100051100029.
It is an arithmetic number, because the mean of its divisors is an integer number (100051100029).
Almost surely, 2200102200057 is an apocalyptic number.
It is an amenable number.
200102200057 is a deficient number, since it is larger than the sum of its proper divisors (1).
200102200057 is an equidigital number, since it uses as much as digits as its factorization.
200102200057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 280, while the sum is 19.
Adding to 200102200057 its reverse (750002201002), we get a palindrome (950104401059).
The spelling of 200102200057 in words is "two hundred billion, one hundred two million, two hundred thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •