Base | Representation |
---|---|
bin | 11101110010011110101110… |
… | …011001000010101100111111 |
3 | 122011212122200100221121120201 |
4 | 131302132232121002230333 |
5 | 114133001204141331033 |
6 | 1142350120435424331 |
7 | 36411220153165612 |
oct | 3562365631025477 |
9 | 564778610847521 |
10 | 131012313230143 |
11 | 38821012375184 |
12 | 1283b0927550a7 |
13 | 581453c866207 |
14 | 244d05ba7c179 |
15 | 1022de6d0447d |
hex | 7727ae642b3f |
131012313230143 has 2 divisors, whose sum is σ = 131012313230144. Its totient is φ = 131012313230142.
The previous prime is 131012313230083. The next prime is 131012313230203. The reversal of 131012313230143 is 341032313210131.
It is a balanced prime because it is at equal distance from previous prime (131012313230083) and next prime (131012313230203).
It is an emirp because it is prime and its reverse (341032313210131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131012313230143 - 229 = 131011776359231 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131012313230243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65506156615071 + 65506156615072.
It is an arithmetic number, because the mean of its divisors is an integer number (65506156615072).
Almost surely, 2131012313230143 is an apocalyptic number.
131012313230143 is a deficient number, since it is larger than the sum of its proper divisors (1).
131012313230143 is an equidigital number, since it uses as much as digits as its factorization.
131012313230143 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 131012313230143 its reverse (341032313210131), we get a palindrome (472044626440274).
The spelling of 131012313230143 in words is "one hundred thirty-one trillion, twelve billion, three hundred thirteen million, two hundred thirty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •