Base | Representation |
---|---|
bin | 100000000001000110001… |
… | …101000111111110011011 |
3 | 21210100002210112112110111 |
4 | 200001012031013332123 |
5 | 242022002440214321 |
6 | 4402431453225151 |
7 | 314650014534001 |
oct | 40010615077633 |
9 | 7710083475414 |
10 | 2200201101211 |
11 | 779111187333 |
12 | 2b64b6a921b7 |
13 | 12c62a434b39 |
14 | 786c155ca71 |
15 | 3c373e275e1 |
hex | 20046347f9b |
2200201101211 has 2 divisors, whose sum is σ = 2200201101212. Its totient is φ = 2200201101210.
The previous prime is 2200201101101. The next prime is 2200201101233. The reversal of 2200201101211 is 1121011020022.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2200201101211 - 217 = 2200200970139 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2200201101191 and 2200201101200.
It is not a weakly prime, because it can be changed into another prime (2200201101271) 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, 1100100550605 + 1100100550606.
It is an arithmetic number, because the mean of its divisors is an integer number (1100100550606).
Almost surely, 22200201101211 is an apocalyptic number.
2200201101211 is a deficient number, since it is larger than the sum of its proper divisors (1).
2200201101211 is an equidigital number, since it uses as much as digits as its factorization.
2200201101211 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 2200201101211 its reverse (1121011020022), we get a palindrome (3321212121233).
It can be divided in two parts, 220020 and 1101211, that added together give a palindrome (1321231).
The spelling of 2200201101211 in words is "two trillion, two hundred billion, two hundred one million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •