Base | Representation |
---|---|
bin | 110010000011001010101111… |
… | …000100100100110001101011 |
3 | 1001212101021020001012201222022 |
4 | 302003022233010210301223 |
5 | 212322421240322211021 |
6 | 2100053423114415055 |
7 | 64236101035204604 |
oct | 6203125704446153 |
9 | 1055337201181868 |
10 | 220120011132011 |
11 | 64156410849111 |
12 | 2083089643148b |
13 | 95a92c6b56b63 |
14 | 3c4dc18884dab |
15 | 1a6ac5ed791ab |
hex | c832af124c6b |
220120011132011 has 2 divisors, whose sum is σ = 220120011132012. Its totient is φ = 220120011132010.
The previous prime is 220120011131981. The next prime is 220120011132013. The reversal of 220120011132011 is 110231110021022.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220120011132011 is a prime.
Together with 220120011132013, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (220120011132013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110060005566005 + 110060005566006.
It is an arithmetic number, because the mean of its divisors is an integer number (110060005566006).
Almost surely, 2220120011132011 is an apocalyptic number.
220120011132011 is a deficient number, since it is larger than the sum of its proper divisors (1).
220120011132011 is an equidigital number, since it uses as much as digits as its factorization.
220120011132011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 220120011132011 its reverse (110231110021022), we get a palindrome (330351121153033).
It can be divided in two parts, 220120011 and 132011, that added together give a palindrome (220252022).
The spelling of 220120011132011 in words is "two hundred twenty trillion, one hundred twenty billion, eleven million, one hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •