Base | Representation |
---|---|
bin | 110010000011001010111010… |
… | …111111011100000100010011 |
3 | 1001212101021201222111210020101 |
4 | 302003022322333130010103 |
5 | 212322422143021042321 |
6 | 2100053455020553231 |
7 | 64236106014050344 |
oct | 6203127277340423 |
9 | 1055337658453211 |
10 | 220120211112211 |
11 | 64156503718203 |
12 | 208309313b2817 |
13 | 95a9329405137 |
14 | 3c4dc372600cb |
15 | 1a6ac726cc791 |
hex | c832bafdc113 |
220120211112211 has 16 divisors (see below), whose sum is σ = 233978160850560. Its totient is φ = 206363358822400.
The previous prime is 220120211112199. The next prime is 220120211112239. The reversal of 220120211112211 is 112211112021022.
It is a happy number.
220120211112211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 220120211112211 - 221 = 220120209015059 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220120211112911) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 432796761 + ... + 433305061.
It is an arithmetic number, because the mean of its divisors is an integer number (14623635053160).
Almost surely, 2220120211112211 is an apocalyptic number.
220120211112211 is a deficient number, since it is larger than the sum of its proper divisors (13857949738349).
220120211112211 is a wasteful number, since it uses less digits than its factorization.
220120211112211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 607694.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 220120211112211 its reverse (112211112021022), we get a palindrome (332331323133233).
The spelling of 220120211112211 in words is "two hundred twenty trillion, one hundred twenty billion, two hundred eleven million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •