Base | Representation |
---|---|
bin | 111101001001011001… |
… | …1111100111011010101 |
3 | 110112221100220101222021 |
4 | 1322102303330323111 |
5 | 4122411400030232 |
6 | 140153550133141 |
7 | 12326015346532 |
oct | 1722263747325 |
9 | 415840811867 |
10 | 131312111317 |
11 | 50764299852 |
12 | 215481b11b1 |
13 | c4c899036a |
14 | 64d985dd89 |
15 | 3638147397 |
hex | 1e92cfced5 |
131312111317 has 2 divisors, whose sum is σ = 131312111318. Its totient is φ = 131312111316.
The previous prime is 131312111167. The next prime is 131312111339. The reversal of 131312111317 is 713111213131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77543313156 + 53768798161 = 278466^2 + 231881^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131312111317 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131312111291 and 131312111300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131312117317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65656055658 + 65656055659.
It is an arithmetic number, because the mean of its divisors is an integer number (65656055659).
Almost surely, 2131312111317 is an apocalyptic number.
It is an amenable number.
131312111317 is a deficient number, since it is larger than the sum of its proper divisors (1).
131312111317 is an equidigital number, since it uses as much as digits as its factorization.
131312111317 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 378, while the sum is 25.
Adding to 131312111317 its reverse (713111213131), we get a palindrome (844423324448).
The spelling of 131312111317 in words is "one hundred thirty-one billion, three hundred twelve million, one hundred eleven thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •