Base | Representation |
---|---|
bin | 110010000011001100100101… |
… | …101111101000100010100111 |
3 | 1001212101110100210121222021201 |
4 | 302003030211233220202213 |
5 | 212322434330021143421 |
6 | 2100054352440423331 |
7 | 64236201262340653 |
oct | 6203144557504247 |
9 | 1055343323558251 |
10 | 220122002131111 |
11 | 641572426a8213 |
12 | 20831151177b47 |
13 | 95a955349c332 |
14 | 3c4dd67079a63 |
15 | 1a6ad29a5eb91 |
hex | c83325be88a7 |
220122002131111 has 16 divisors (see below), whose sum is σ = 228985751806560. Its totient is φ = 211435127815680.
The previous prime is 220122002131103. The next prime is 220122002131151. The reversal of 220122002131111 is 111131200221022.
It is a cyclic number.
It is not a de Polignac number, because 220122002131111 - 23 = 220122002131103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220122002131151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 63630756 + ... + 67000873.
It is an arithmetic number, because the mean of its divisors is an integer number (14311609487910).
Almost surely, 2220122002131111 is an apocalyptic number.
220122002131111 is a deficient number, since it is larger than the sum of its proper divisors (8863749675449).
220122002131111 is a wasteful number, since it uses less digits than its factorization.
220122002131111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130632306.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 220122002131111 its reverse (111131200221022), we get a palindrome (331253202352133).
The spelling of 220122002131111 in words is "two hundred twenty trillion, one hundred twenty-two billion, two million, one hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •