Base | Representation |
---|---|
bin | 1100110100101110100… |
… | …0010001100111101111 |
3 | 210001122221020101212222 |
4 | 3031023220101213233 |
5 | 12102144404244411 |
6 | 245113210345555 |
7 | 21626353433162 |
oct | 3151350214757 |
9 | 701587211788 |
10 | 220312181231 |
11 | 8548553463a |
12 | 3684612b2bb |
13 | 17a1059b21c |
14 | a93da2bad9 |
15 | 5ae68084db |
hex | 334ba119ef |
220312181231 has 2 divisors, whose sum is σ = 220312181232. Its totient is φ = 220312181230.
The previous prime is 220312181213. The next prime is 220312181239. The reversal of 220312181231 is 132181213022.
Together with previous prime (220312181213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220312181231 is a prime.
It is a super-2 number, since 2×2203121812312 (a number of 23 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 220312181231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220312181239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110156090615 + 110156090616.
It is an arithmetic number, because the mean of its divisors is an integer number (110156090616).
Almost surely, 2220312181231 is an apocalyptic number.
220312181231 is a deficient number, since it is larger than the sum of its proper divisors (1).
220312181231 is an equidigital number, since it uses as much as digits as its factorization.
220312181231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 220312181231 its reverse (132181213022), we get a palindrome (352493394253).
The spelling of 220312181231 in words is "two hundred twenty billion, three hundred twelve million, one hundred eighty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •