Base | Representation |
---|---|
bin | 111101000000011100… |
… | …0011111101001010101 |
3 | 110112011101220020011201 |
4 | 1322000320133221111 |
5 | 4121302343442323 |
6 | 140104043032501 |
7 | 12315403531315 |
oct | 1720070375125 |
9 | 415141806151 |
10 | 131011312213 |
11 | 5061a519a51 |
12 | 2148350b731 |
13 | c47b572922 |
14 | 64ab91d445 |
15 | 361ba2b8ad |
hex | 1e80e1fa55 |
131011312213 has 2 divisors, whose sum is σ = 131011312214. Its totient is φ = 131011312212.
The previous prime is 131011312193. The next prime is 131011312231. The reversal of 131011312213 is 312213110131.
Together with next prime (131011312231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88656849009 + 42354463204 = 297753^2 + 205802^2 .
It is a cyclic number.
It is not a de Polignac number, because 131011312213 - 25 = 131011312181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131011312283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65505656106 + 65505656107.
It is an arithmetic number, because the mean of its divisors is an integer number (65505656107).
Almost surely, 2131011312213 is an apocalyptic number.
It is an amenable number.
131011312213 is a deficient number, since it is larger than the sum of its proper divisors (1).
131011312213 is an equidigital number, since it uses as much as digits as its factorization.
131011312213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 131011312213 its reverse (312213110131), we get a palindrome (443224422344).
The spelling of 131011312213 in words is "one hundred thirty-one billion, eleven million, three hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •