Base | Representation |
---|---|
bin | 111101001001110010… |
… | …1100001000101110101 |
3 | 110112222021100112021022 |
4 | 1322103211201011311 |
5 | 4122423211321001 |
6 | 140155132430525 |
7 | 12326233653533 |
oct | 1722345410565 |
9 | 415867315238 |
10 | 131325104501 |
11 | 50770663818 |
12 | 21550618445 |
13 | c4cb58c436 |
14 | 64db483153 |
15 | 363936211b |
hex | 1e93961175 |
131325104501 has 2 divisors, whose sum is σ = 131325104502. Its totient is φ = 131325104500.
The previous prime is 131325104497. The next prime is 131325104503. The reversal of 131325104501 is 105401523131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127456140100 + 3868964401 = 357010^2 + 62201^2 .
It is a cyclic number.
It is not a de Polignac number, because 131325104501 - 22 = 131325104497 is a prime.
Together with 131325104503, 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 (131325104503) 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, 65662552250 + 65662552251.
It is an arithmetic number, because the mean of its divisors is an integer number (65662552251).
Almost surely, 2131325104501 is an apocalyptic number.
It is an amenable number.
131325104501 is a deficient number, since it is larger than the sum of its proper divisors (1).
131325104501 is an equidigital number, since it uses as much as digits as its factorization.
131325104501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 131325104501 its reverse (105401523131), we get a palindrome (236726627632).
The spelling of 131325104501 in words is "one hundred thirty-one billion, three hundred twenty-five million, one hundred four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •