Base | Representation |
---|---|
bin | 101101011110101011001111… |
… | …101010100000101000000001 |
3 | 222020012201212110000211002112 |
4 | 231132223033222200220001 |
5 | 202204112141404031423 |
6 | 1545223545342025105 |
7 | 60062655546105653 |
oct | 5536531752405001 |
9 | 866181773024075 |
10 | 200020111002113 |
11 | 58807064168956 |
12 | 1a5252a2578195 |
13 | 877ba7a96002c |
14 | 375704c9626d3 |
15 | 181ceae934a78 |
hex | b5eacfaa0a01 |
200020111002113 has 2 divisors, whose sum is σ = 200020111002114. Its totient is φ = 200020111002112.
The previous prime is 200020111002083. The next prime is 200020111002167. The reversal of 200020111002113 is 311200111020002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 156380452217089 + 43639658785024 = 12505217^2 + 6606032^2 .
It is a cyclic number.
It is not a de Polignac number, because 200020111002113 - 222 = 200020106807809 is a prime.
It is not a weakly prime, because it can be changed into another prime (200020111002193) 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, 100010055501056 + 100010055501057.
It is an arithmetic number, because the mean of its divisors is an integer number (100010055501057).
Almost surely, 2200020111002113 is an apocalyptic number.
It is an amenable number.
200020111002113 is a deficient number, since it is larger than the sum of its proper divisors (1).
200020111002113 is an equidigital number, since it uses as much as digits as its factorization.
200020111002113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 200020111002113 its reverse (311200111020002), we get a palindrome (511220222022115).
The spelling of 200020111002113 in words is "two hundred trillion, twenty billion, one hundred eleven million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •