Base | Representation |
---|---|
bin | 101101100001011100010010… |
… | …100000111000000001011111 |
3 | 222020212220112211220221001101 |
4 | 231201130102200320001133 |
5 | 202220221003021023012 |
6 | 1545451145023053531 |
7 | 60112465446265456 |
oct | 5541342240700137 |
9 | 866786484827041 |
10 | 200210211111007 |
11 | 5887a745780369 |
12 | 1a5560b67412a7 |
13 | 8793984c42c76 |
14 | 3762323cddb9d |
15 | 1822dd8bc2d57 |
hex | b6171283805f |
200210211111007 has 2 divisors, whose sum is σ = 200210211111008. Its totient is φ = 200210211111006.
The previous prime is 200210211110977. The next prime is 200210211111013. The reversal of 200210211111007 is 700111112012002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200210211111007 - 211 = 200210211108959 is a prime.
It is a super-2 number, since 2×2002102111110072 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200210211111907) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105105555503 + 100105105555504.
It is an arithmetic number, because the mean of its divisors is an integer number (100105105555504).
Almost surely, 2200210211111007 is an apocalyptic number.
200210211111007 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210211111007 is an equidigital number, since it uses as much as digits as its factorization.
200210211111007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 200210211111007 its reverse (700111112012002), we get a palindrome (900321323123009).
The spelling of 200210211111007 in words is "two hundred trillion, two hundred ten billion, two hundred eleven million, one hundred eleven thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •