Base | Representation |
---|---|
bin | 1000100111000011… |
… | …1110001011110101 |
3 | 12222002011000210012 |
4 | 2021300332023311 |
5 | 14213144104323 |
6 | 1021203310005 |
7 | 111163602143 |
oct | 21160761365 |
9 | 5862130705 |
10 | 2311316213 |
11 | a86750098 |
12 | 54607b305 |
13 | 2aab07b3b |
14 | 17cd76593 |
15 | d7da9678 |
hex | 89c3e2f5 |
2311316213 has 2 divisors, whose sum is σ = 2311316214. Its totient is φ = 2311316212.
The previous prime is 2311316201. The next prime is 2311316221. The reversal of 2311316213 is 3126131132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2128715044 + 182601169 = 46138^2 + 13513^2 .
It is a cyclic number.
It is not a de Polignac number, because 2311316213 - 26 = 2311316149 is a prime.
It is a super-2 number, since 2×23113162132 = 10684365272953322738, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2311316233) 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, 1155658106 + 1155658107.
It is an arithmetic number, because the mean of its divisors is an integer number (1155658107).
Almost surely, 22311316213 is an apocalyptic number.
It is an amenable number.
2311316213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2311316213 is an equidigital number, since it uses as much as digits as its factorization.
2311316213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 648, while the sum is 23.
The square root of 2311316213 is about 48076.1501474484. The cubic root of 2311316213 is about 1322.1674318345.
Adding to 2311316213 its reverse (3126131132), we get a palindrome (5437447345).
The spelling of 2311316213 in words is "two billion, three hundred eleven million, three hundred sixteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •