Base | Representation |
---|---|
bin | 101101101101010000011100… |
… | …000100010011011011110011 |
3 | 222100202112020012010200200101 |
4 | 231231100130010103123303 |
5 | 202322021300233242321 |
6 | 1551312142004533231 |
7 | 60225240351626254 |
oct | 5555203404233363 |
9 | 870675205120611 |
10 | 201022120212211 |
11 | 59063003251061 |
12 | 1a6675253b1217 |
13 | 88223c627908c |
14 | 378d745b80b2b |
15 | 18390a777c791 |
hex | b6d41c1136f3 |
201022120212211 has 2 divisors, whose sum is σ = 201022120212212. Its totient is φ = 201022120212210.
The previous prime is 201022120212113. The next prime is 201022120212233. The reversal of 201022120212211 is 112212021220102.
201022120212211 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 not a de Polignac number, because 201022120212211 - 221 = 201022118115059 is a prime.
It is a super-2 number, since 2×2010221202122112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201022120212241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100511060106105 + 100511060106106.
It is an arithmetic number, because the mean of its divisors is an integer number (100511060106106).
Almost surely, 2201022120212211 is an apocalyptic number.
201022120212211 is a deficient number, since it is larger than the sum of its proper divisors (1).
201022120212211 is an equidigital number, since it uses as much as digits as its factorization.
201022120212211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 201022120212211 its reverse (112212021220102), we get a palindrome (313234141432313).
The spelling of 201022120212211 in words is "two hundred one trillion, twenty-two billion, one hundred twenty million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •