Base | Representation |
---|---|
bin | 101101100001100101100001… |
… | …010000010011100111000011 |
3 | 222020220212010120012110001200 |
4 | 231201211201100103213003 |
5 | 202220401302224232321 |
6 | 1545455504310032243 |
7 | 60113266163313531 |
oct | 5541454120234703 |
9 | 866825116173050 |
10 | 200220122102211 |
11 | 58883971220792 |
12 | 1a558001948683 |
13 | 87948a43676c3 |
14 | 37629c42d3151 |
15 | 18232b8d4cd26 |
hex | b619614139c3 |
200220122102211 has 6 divisors (see below), whose sum is σ = 289206843036540. Its totient is φ = 133480081401468.
The previous prime is 200220122102197. The next prime is 200220122102237. The reversal of 200220122102211 is 112201221022002.
It is a happy number.
200220122102211 is a `hidden beast` number, since 2 + 0 + 0 + 220 + 1 + 221 + 0 + 221 + 1 = 666.
It is not a de Polignac number, because 200220122102211 - 229 = 200219585231299 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200220122102261) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11123340116781 + ... + 11123340116798.
It is an arithmetic number, because the mean of its divisors is an integer number (48201140506090).
Almost surely, 2200220122102211 is an apocalyptic number.
200220122102211 is a deficient number, since it is larger than the sum of its proper divisors (88986720934329).
200220122102211 is a wasteful number, since it uses less digits than its factorization.
200220122102211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22246680233585 (or 22246680233582 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 200220122102211 its reverse (112201221022002), we get a palindrome (312421343124213).
The spelling of 200220122102211 in words is "two hundred trillion, two hundred twenty billion, one hundred twenty-two million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •