Base | Representation |
---|---|
bin | 111101000011011010… |
… | …1100010011000101101 |
3 | 110112102100212001212112 |
4 | 1322012311202120231 |
5 | 4122003431402201 |
6 | 140122012013405 |
7 | 12321025546244 |
oct | 1720665423055 |
9 | 415370761775 |
10 | 131111200301 |
11 | 50670944394 |
12 | 214b0a61265 |
13 | c4961774c3 |
14 | 64bacc195b |
15 | 36256ad0bb |
hex | 1e86d6262d |
131111200301 has 2 divisors, whose sum is σ = 131111200302. Its totient is φ = 131111200300.
The previous prime is 131111200249. The next prime is 131111200303. The reversal of 131111200301 is 103002111131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 125266444900 + 5844755401 = 353930^2 + 76451^2 .
It is a cyclic number.
It is not a de Polignac number, because 131111200301 - 234 = 113931331117 is a prime.
Together with 131111200303, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131111200303) 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, 65555600150 + 65555600151.
It is an arithmetic number, because the mean of its divisors is an integer number (65555600151).
Almost surely, 2131111200301 is an apocalyptic number.
It is an amenable number.
131111200301 is a deficient number, since it is larger than the sum of its proper divisors (1).
131111200301 is an equidigital number, since it uses as much as digits as its factorization.
131111200301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 131111200301 its reverse (103002111131), we get a palindrome (234113311432).
The spelling of 131111200301 in words is "one hundred thirty-one billion, one hundred eleven million, two hundred thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •