Base | Representation |
---|---|
bin | 111101000011001011… |
… | …1000011101000011101 |
3 | 110112101210211010020221 |
4 | 1322012113003220131 |
5 | 4121444410210023 |
6 | 140121124441341 |
7 | 12320600620036 |
oct | 1720627035035 |
9 | 415353733227 |
10 | 131103210013 |
11 | 50667387146 |
12 | 214aa249251 |
13 | c49460a619 |
14 | 64b9c01a8d |
15 | 3624b3085d |
hex | 1e865c3a1d |
131103210013 has 2 divisors, whose sum is σ = 131103210014. Its totient is φ = 131103210012.
The previous prime is 131103209989. The next prime is 131103210019. The reversal of 131103210013 is 310012301131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110152963449 + 20950246564 = 331893^2 + 144742^2 .
It is a cyclic number.
It is not a de Polignac number, because 131103210013 - 225 = 131069655581 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131103210019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65551605006 + 65551605007.
It is an arithmetic number, because the mean of its divisors is an integer number (65551605007).
Almost surely, 2131103210013 is an apocalyptic number.
It is an amenable number.
131103210013 is a deficient number, since it is larger than the sum of its proper divisors (1).
131103210013 is an equidigital number, since it uses as much as digits as its factorization.
131103210013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 131103210013 its reverse (310012301131), we get a palindrome (441115511144).
The spelling of 131103210013 in words is "one hundred thirty-one billion, one hundred three million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •