Base | Representation |
---|---|
bin | 11101110110101101100011… |
… | …111100100010010111011001 |
3 | 122012220110022022222210000222 |
4 | 131312231203330202113121 |
5 | 114202232243214113201 |
6 | 1143131453241205425 |
7 | 36441223524131534 |
oct | 3566554374422731 |
9 | 565813268883028 |
10 | 131303122019801 |
11 | 38923383351076 |
12 | 12887511a90875 |
13 | 5835aa6417204 |
14 | 245d168233a1b |
15 | 102a76761691b |
hex | 776b63f225d9 |
131303122019801 has 2 divisors, whose sum is σ = 131303122019802. Its totient is φ = 131303122019800.
The previous prime is 131303122019791. The next prime is 131303122019803. The reversal of 131303122019801 is 108910221303131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122327249827225 + 8975872192576 = 11060165^2 + 2995976^2 .
It is a cyclic number.
It is not a de Polignac number, because 131303122019801 - 230 = 131302048277977 is a prime.
It is a Sophie Germain prime.
Together with 131303122019803, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (131303122019803) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65651561009900 + 65651561009901.
It is an arithmetic number, because the mean of its divisors is an integer number (65651561009901).
Almost surely, 2131303122019801 is an apocalyptic number.
It is an amenable number.
131303122019801 is a deficient number, since it is larger than the sum of its proper divisors (1).
131303122019801 is an equidigital number, since it uses as much as digits as its factorization.
131303122019801 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7776, while the sum is 35.
The spelling of 131303122019801 in words is "one hundred thirty-one trillion, three hundred three billion, one hundred twenty-two million, nineteen thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •