Base | Representation |
---|---|
bin | 111101000011011010… |
… | …1001100011000111001 |
3 | 110112102100200111021111 |
4 | 1322012311030120321 |
5 | 4122003421011301 |
6 | 140122010040321 |
7 | 12321025022461 |
oct | 1720665143071 |
9 | 415370614244 |
10 | 131111110201 |
11 | 50670892725 |
12 | 214b0a190a1 |
13 | c4961454a6 |
14 | 64bac9aba1 |
15 | 3625691551 |
hex | 1e86d4c639 |
131111110201 has 2 divisors, whose sum is σ = 131111110202. Its totient is φ = 131111110200.
The previous prime is 131111110187. The next prime is 131111110259. The reversal of 131111110201 is 102011111131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67483570176 + 63627540025 = 259776^2 + 252245^2 .
It is a cyclic number.
It is not a de Polignac number, because 131111110201 - 235 = 96751371833 is a prime.
It is not a weakly prime, because it can be changed into another prime (131111110901) 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, 65555555100 + 65555555101.
It is an arithmetic number, because the mean of its divisors is an integer number (65555555101).
Almost surely, 2131111110201 is an apocalyptic number.
It is an amenable number.
131111110201 is a deficient number, since it is larger than the sum of its proper divisors (1).
131111110201 is an equidigital number, since it uses as much as digits as its factorization.
131111110201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 131111110201 its reverse (102011111131), we get a palindrome (233122221332).
The spelling of 131111110201 in words is "one hundred thirty-one billion, one hundred eleven million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •