Base | Representation |
---|---|
bin | 1011101101001110110… |
… | …0110000010000110011 |
3 | 201020010102011202201212 |
4 | 2323103230300100303 |
5 | 11243343234021321 |
6 | 232220544150335 |
7 | 20346642444101 |
oct | 2732354602063 |
9 | 636112152655 |
10 | 201120220211 |
11 | 78327137229 |
12 | 32b8a9083ab |
13 | 15c7242c581 |
14 | 9a3cba4c71 |
15 | 53719a155b |
hex | 2ed3b30433 |
201120220211 has 2 divisors, whose sum is σ = 201120220212. Its totient is φ = 201120220210.
The previous prime is 201120220163. The next prime is 201120220219. The reversal of 201120220211 is 112022021102.
201120220211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201120220211 is a prime.
It is a super-2 number, since 2×2011202202112 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201120220219) 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, 100560110105 + 100560110106.
It is an arithmetic number, because the mean of its divisors is an integer number (100560110106).
Almost surely, 2201120220211 is an apocalyptic number.
201120220211 is a deficient number, since it is larger than the sum of its proper divisors (1).
201120220211 is an equidigital number, since it uses as much as digits as its factorization.
201120220211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201120220211 its reverse (112022021102), we get a palindrome (313142241313).
The spelling of 201120220211 in words is "two hundred one billion, one hundred twenty million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •