Base | Representation |
---|---|
bin | 11101110010100110000110… |
… | …010010010100100000111111 |
3 | 122011220102010010100010222111 |
4 | 131302212012102110200333 |
5 | 114133113412430022142 |
6 | 1142353510214154451 |
7 | 36411620306246104 |
oct | 3562460622244077 |
9 | 564812103303874 |
10 | 131020230314047 |
11 | 3882440535a528 |
12 | 12840722052a27 |
13 | 5815201b67849 |
14 | 244d5ad320aab |
15 | 102320bdc1e17 |
hex | 77298649483f |
131020230314047 has 2 divisors, whose sum is σ = 131020230314048. Its totient is φ = 131020230314046.
The previous prime is 131020230313979. The next prime is 131020230314053. The reversal of 131020230314047 is 740413032020131.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131020230314047 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131020230314447) 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, 65510115157023 + 65510115157024.
It is an arithmetic number, because the mean of its divisors is an integer number (65510115157024).
Almost surely, 2131020230314047 is an apocalyptic number.
131020230314047 is a deficient number, since it is larger than the sum of its proper divisors (1).
131020230314047 is an equidigital number, since it uses as much as digits as its factorization.
131020230314047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 31.
Adding to 131020230314047 its reverse (740413032020131), we get a palindrome (871433262334178).
The spelling of 131020230314047 in words is "one hundred thirty-one trillion, twenty billion, two hundred thirty million, three hundred fourteen thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •