Base | Representation |
---|---|
bin | 101101100001011100010010… |
… | …100100010011100010000001 |
3 | 222020212220112220121121101121 |
4 | 231201130102210103202001 |
5 | 202220221003233310423 |
6 | 1545451145054232241 |
7 | 60112465460031664 |
oct | 5541342244234201 |
9 | 866786486547347 |
10 | 200210212010113 |
11 | 5887a746234928 |
12 | 1a5560b6ab5681 |
13 | 8793985199296 |
14 | 37623240956db |
15 | 1822dd8cee45d |
hex | b61712913881 |
200210212010113 has 2 divisors, whose sum is σ = 200210212010114. Its totient is φ = 200210212010112.
The previous prime is 200210212010033. The next prime is 200210212010117. The reversal of 200210212010113 is 311010212012002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100606857908209 + 99603354101904 = 10030297^2 + 9980148^2 .
It is a cyclic number.
It is not a de Polignac number, because 200210212010113 - 29 = 200210212009601 is a prime.
It is not a weakly prime, because it can be changed into another prime (200210212010117) 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, 100105106005056 + 100105106005057.
It is an arithmetic number, because the mean of its divisors is an integer number (100105106005057).
Almost surely, 2200210212010113 is an apocalyptic number.
It is an amenable number.
200210212010113 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210212010113 is an equidigital number, since it uses as much as digits as its factorization.
200210212010113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 200210212010113 its reverse (311010212012002), we get a palindrome (511220424022115).
The spelling of 200210212010113 in words is "two hundred trillion, two hundred ten billion, two hundred twelve million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •