Base | Representation |
---|---|
bin | 10011000100001001111… |
… | …001001001011100110101 |
3 | 11122020200021121122010122 |
4 | 103010021321021130311 |
5 | 132431122014014031 |
6 | 2441511010101325 |
7 | 163440160524014 |
oct | 23041171113465 |
9 | 4566607548118 |
10 | 1310131001141 |
11 | 465694882306 |
12 | 191ab427a845 |
13 | 96710c90c81 |
14 | 475a6c8ca7b |
15 | 2412d55d47b |
hex | 13109e49735 |
1310131001141 has 2 divisors, whose sum is σ = 1310131001142. Its totient is φ = 1310131001140.
The previous prime is 1310131001107. The next prime is 1310131001147. The reversal of 1310131001141 is 1411001310131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1293166980625 + 16964020516 = 1137175^2 + 130246^2 .
It is a cyclic number.
It is not a de Polignac number, because 1310131001141 - 222 = 1310126806837 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1310131001147) 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, 655065500570 + 655065500571.
It is an arithmetic number, because the mean of its divisors is an integer number (655065500571).
Almost surely, 21310131001141 is an apocalyptic number.
It is an amenable number.
1310131001141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310131001141 is an equidigital number, since it uses as much as digits as its factorization.
1310131001141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 1310131001141 its reverse (1411001310131), we get a palindrome (2721132311272).
The spelling of 1310131001141 in words is "one trillion, three hundred ten billion, one hundred thirty-one million, one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •