Base | Representation |
---|---|
bin | 1000001101010010… |
… | …1000100001000011 |
3 | 12200112202101022202 |
4 | 2003110220201003 |
5 | 14003011133011 |
6 | 1002342423415 |
7 | 105412044653 |
oct | 20324504103 |
9 | 5615671282 |
10 | 2203224131 |
11 | a30731999 |
12 | 515a31b6b |
13 | 2915c0024 |
14 | 16c87a363 |
15 | cd65723b |
hex | 83528843 |
2203224131 has 2 divisors, whose sum is σ = 2203224132. Its totient is φ = 2203224130.
The previous prime is 2203224113. The next prime is 2203224139. The reversal of 2203224131 is 1314223022.
Together with previous prime (2203224113) 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 not a de Polignac number, because 2203224131 - 218 = 2202961987 is a prime.
It is a super-2 number, since 2×22032241312 = 9708393142841410322, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2203224139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1101612065 + 1101612066.
It is an arithmetic number, because the mean of its divisors is an integer number (1101612066).
Almost surely, 22203224131 is an apocalyptic number.
2203224131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2203224131 is an equidigital number, since it uses as much as digits as its factorization.
2203224131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 2203224131 is about 46938.5143672017. The cubic root of 2203224131 is about 1301.2264817654.
Adding to 2203224131 its reverse (1314223022), we get a palindrome (3517447153).
The spelling of 2203224131 in words is "two billion, two hundred three million, two hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •