Base | Representation |
---|---|
bin | 101101011110101101001100… |
… | …110001100011100011010111 |
3 | 222020012221021201200000102011 |
4 | 231132231030301203203113 |
5 | 202204130441230013421 |
6 | 1545224533522525051 |
7 | 60063061554233401 |
oct | 5536551461434327 |
9 | 866187251600364 |
10 | 200022210001111 |
11 | 58807a40a82973 |
12 | 1a525789506787 |
13 | 877c02378a384 |
14 | 37571ab62bb71 |
15 | 181d083d504e1 |
hex | b5eb4cc638d7 |
200022210001111 has 2 divisors, whose sum is σ = 200022210001112. Its totient is φ = 200022210001110.
The previous prime is 200022210001067. The next prime is 200022210001121. The reversal of 200022210001111 is 111100012220002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200022210001111 - 219 = 200022209476823 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200022210001091 and 200022210001100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200022210001121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100011105000555 + 100011105000556.
It is an arithmetic number, because the mean of its divisors is an integer number (100011105000556).
Almost surely, 2200022210001111 is an apocalyptic number.
200022210001111 is a deficient number, since it is larger than the sum of its proper divisors (1).
200022210001111 is an equidigital number, since it uses as much as digits as its factorization.
200022210001111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200022210001111 its reverse (111100012220002), we get a palindrome (311122222221113).
The spelling of 200022210001111 in words is "two hundred trillion, twenty-two billion, two hundred ten million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •