Base | Representation |
---|---|
bin | 1011101001110110000… |
… | …0011001001001000101 |
3 | 201010210001100002221221 |
4 | 2322131200121021011 |
5 | 11240013004310432 |
6 | 231550424440341 |
7 | 20315262335566 |
oct | 2723540311105 |
9 | 633701302857 |
10 | 200211010117 |
11 | 779aa994228 |
12 | 329763190b1 |
13 | 15b58c5ca31 |
14 | 999412c16d |
15 | 531bc55b97 |
hex | 2e9d819245 |
200211010117 has 2 divisors, whose sum is σ = 200211010118. Its totient is φ = 200211010116.
The previous prime is 200211010099. The next prime is 200211010151. The reversal of 200211010117 is 711010112002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 129046911361 + 71164098756 = 359231^2 + 266766^2 .
It is a cyclic number.
It is not a de Polignac number, because 200211010117 - 211 = 200211008069 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200211010117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200211010157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105505058 + 100105505059.
It is an arithmetic number, because the mean of its divisors is an integer number (100105505059).
Almost surely, 2200211010117 is an apocalyptic number.
It is an amenable number.
200211010117 is a deficient number, since it is larger than the sum of its proper divisors (1).
200211010117 is an equidigital number, since it uses as much as digits as its factorization.
200211010117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 16.
Adding to 200211010117 its reverse (711010112002), we get a palindrome (911221122119).
The spelling of 200211010117 in words is "two hundred billion, two hundred eleven million, ten thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •