Base | Representation |
---|---|
bin | 10011000110001011110… |
… | …010001000101100101011 |
3 | 11122110022011011110112101 |
4 | 103012023302020230223 |
5 | 133000102402414011 |
6 | 2442511133554231 |
7 | 163545161442526 |
oct | 23061362105453 |
9 | 4573264143471 |
10 | 1312310201131 |
11 | 466602995536 |
12 | 192402045977 |
13 | 9699a5bc017 |
14 | 47732473bbd |
15 | 24209a1c2c1 |
hex | 1318bc88b2b |
1312310201131 has 2 divisors, whose sum is σ = 1312310201132. Its totient is φ = 1312310201130.
The previous prime is 1312310201047. The next prime is 1312310201161. The reversal of 1312310201131 is 1311020132131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1312310201131 - 217 = 1312310070059 is a prime.
It is a super-2 number, since 2×13123102011312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1312310201099 and 1312310201108.
It is not a weakly prime, because it can be changed into another prime (1312310201161) 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, 656155100565 + 656155100566.
It is an arithmetic number, because the mean of its divisors is an integer number (656155100566).
Almost surely, 21312310201131 is an apocalyptic number.
1312310201131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312310201131 is an equidigital number, since it uses as much as digits as its factorization.
1312310201131 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 1312310201131 its reverse (1311020132131), we get a palindrome (2623330333262).
The spelling of 1312310201131 in words is "one trillion, three hundred twelve billion, three hundred ten million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •