Base | Representation |
---|---|
bin | 101101100001011101001000… |
… | …110000010000000010110110 |
3 | 222020212222220021020201200001 |
4 | 231201131020300100002312 |
5 | 202220224334001024342 |
6 | 1545451415211341514 |
7 | 60112530136204354 |
oct | 5541351060200266 |
9 | 866788807221601 |
10 | 200211121111222 |
11 | 58880072412a61 |
12 | 1a55630b45189a |
13 | 8793a9b62b330 |
14 | 37623acb007d4 |
15 | 1822e3da278b7 |
hex | b61748c100b6 |
200211121111222 has 32 divisors (see below), whose sum is σ = 327869046564192. Its totient is φ = 91133555030784.
The previous prime is 200211121111213. The next prime is 200211121111273. The reversal of 200211121111222 is 222111121112002.
It is a happy number.
It is a super-2 number, since 2×2002111211112222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 200211121111222.
It is a congruent number.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 26812593 + ... + 33456499.
It is an arithmetic number, because the mean of its divisors is an integer number (10245907705131).
Almost surely, 2200211121111222 is an apocalyptic number.
200211121111222 is a deficient number, since it is larger than the sum of its proper divisors (127657925452970).
200211121111222 is a wasteful number, since it uses less digits than its factorization.
200211121111222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6659872.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 200211121111222 its reverse (222111121112002), we get a palindrome (422322242223224).
The spelling of 200211121111222 in words is "two hundred trillion, two hundred eleven billion, one hundred twenty-one million, one hundred eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •