Base | Representation |
---|---|
bin | 11101110011000010110010… |
… | …110001011110100111111001 |
3 | 122012000100122101221001101001 |
4 | 131303002302301132213321 |
5 | 114134120013102403424 |
6 | 1142420003423525001 |
7 | 36414060655503166 |
oct | 3563026261364771 |
9 | 565010571831331 |
10 | 131051041450489 |
11 | 38836486450356 |
12 | 128466a0759761 |
13 | 58180a22b1724 |
14 | 2450c9339306d |
15 | 1023e11d22844 |
hex | 7730b2c5e9f9 |
131051041450489 has 2 divisors, whose sum is σ = 131051041450490. Its totient is φ = 131051041450488.
The previous prime is 131051041450429. The next prime is 131051041450493. The reversal of 131051041450489 is 984054140150131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129247908125625 + 1803133324864 = 11368725^2 + 1342808^2 .
It is a cyclic number.
It is not a de Polignac number, because 131051041450489 - 215 = 131051041417721 is a prime.
It is not a weakly prime, because it can be changed into another prime (131051041450429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65525520725244 + 65525520725245.
It is an arithmetic number, because the mean of its divisors is an integer number (65525520725245).
Almost surely, 2131051041450489 is an apocalyptic number.
It is an amenable number.
131051041450489 is a deficient number, since it is larger than the sum of its proper divisors (1).
131051041450489 is an equidigital number, since it uses as much as digits as its factorization.
131051041450489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 345600, while the sum is 46.
The spelling of 131051041450489 in words is "one hundred thirty-one trillion, fifty-one billion, forty-one million, four hundred fifty thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •