Base | Representation |
---|---|
bin | 1100110100110110001… |
… | …0100101010000001011 |
3 | 210001202011120022122201 |
4 | 3031031202211100023 |
5 | 12102231111240321 |
6 | 245120313501031 |
7 | 21630223110301 |
oct | 3151542452013 |
9 | 701664508581 |
10 | 220344243211 |
11 | 854a1643244 |
12 | 36854a11777 |
13 | 17a17115901 |
14 | a943db6271 |
15 | 5ae953d291 |
hex | 334d8a540b |
220344243211 has 2 divisors, whose sum is σ = 220344243212. Its totient is φ = 220344243210.
The previous prime is 220344243103. The next prime is 220344243239. The reversal of 220344243211 is 112342443022.
It is an a-pointer prime, because the next prime (220344243239) can be obtained adding 220344243211 to its sum of digits (28).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 220344243211 - 27 = 220344243083 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220344243211.
It is not a weakly prime, because it can be changed into another prime (220344243011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110172121605 + 110172121606.
It is an arithmetic number, because the mean of its divisors is an integer number (110172121606).
Almost surely, 2220344243211 is an apocalyptic number.
220344243211 is a deficient number, since it is larger than the sum of its proper divisors (1).
220344243211 is an equidigital number, since it uses as much as digits as its factorization.
220344243211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 220344243211 its reverse (112342443022), we get a palindrome (332686686233).
The spelling of 220344243211 in words is "two hundred twenty billion, three hundred forty-four million, two hundred forty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •