Base | Representation |
---|---|
bin | 111101000000101101… |
… | …0000001101001110101 |
3 | 110112012000102210212001 |
4 | 1322001122001221311 |
5 | 4121312121233021 |
6 | 140104555255301 |
7 | 12315541331266 |
oct | 1720132015165 |
9 | 415160383761 |
10 | 131020102261 |
11 | 50624483054 |
12 | 2148644a531 |
13 | c48032c839 |
14 | 64acb6a96d |
15 | 361c6b6091 |
hex | 1e81681a75 |
131020102261 has 2 divisors, whose sum is σ = 131020102262. Its totient is φ = 131020102260.
The previous prime is 131020102231. The next prime is 131020102273. The reversal of 131020102261 is 162201020131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129146078161 + 1874024100 = 359369^2 + 43290^2 .
It is a cyclic number.
It is not a de Polignac number, because 131020102261 - 211 = 131020100213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131020102231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65510051130 + 65510051131.
It is an arithmetic number, because the mean of its divisors is an integer number (65510051131).
Almost surely, 2131020102261 is an apocalyptic number.
It is an amenable number.
131020102261 is a deficient number, since it is larger than the sum of its proper divisors (1).
131020102261 is an equidigital number, since it uses as much as digits as its factorization.
131020102261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 131020102261 its reverse (162201020131), we get a palindrome (293221122392).
The spelling of 131020102261 in words is "one hundred thirty-one billion, twenty million, one hundred two thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •