Base | Representation |
---|---|
bin | 11101110101001110110110… |
… | …101101101110011110000011 |
3 | 122012112201211100012121222211 |
4 | 131311032312231232132003 |
5 | 114144101012421243133 |
6 | 1143013034443042551 |
7 | 36430663531316041 |
oct | 3565166655563603 |
9 | 565481740177884 |
10 | 131201431431043 |
11 | 3889423a6a0686 |
12 | 1286b871b10457 |
13 | 582931b5a4abc |
14 | 245827c85b391 |
15 | 1027cb4c86bcd |
hex | 7753b6b6e783 |
131201431431043 has 2 divisors, whose sum is σ = 131201431431044. Its totient is φ = 131201431431042.
The previous prime is 131201431431023. The next prime is 131201431431053. The reversal of 131201431431043 is 340134134102131.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131201431431043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131201431430996 and 131201431431014.
It is not a weakly prime, because it can be changed into another prime (131201431431023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65600715715521 + 65600715715522.
It is an arithmetic number, because the mean of its divisors is an integer number (65600715715522).
Almost surely, 2131201431431043 is an apocalyptic number.
131201431431043 is a deficient number, since it is larger than the sum of its proper divisors (1).
131201431431043 is an equidigital number, since it uses as much as digits as its factorization.
131201431431043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 131201431431043 its reverse (340134134102131), we get a palindrome (471335565533174).
The spelling of 131201431431043 in words is "one hundred thirty-one trillion, two hundred one billion, four hundred thirty-one million, four hundred thirty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •