Base | Representation |
---|---|
bin | 1011111100010100110010… |
… | …1001111111101101100101 |
3 | 1201111022102001011222111221 |
4 | 2333011030221333231211 |
5 | 3210114242240214112 |
6 | 43532144300500341 |
7 | 2523453306524122 |
oct | 277051451775545 |
9 | 51438361158457 |
10 | 13131001101157 |
11 | 420290a884a55 |
12 | 1580a6184a6b1 |
13 | 74332c0943a4 |
14 | 335788447749 |
15 | 17b87a347e07 |
hex | bf14ca7fb65 |
13131001101157 has 2 divisors, whose sum is σ = 13131001101158. Its totient is φ = 13131001101156.
The previous prime is 13131001101131. The next prime is 13131001101271. The reversal of 13131001101157 is 75110110013131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12500460288801 + 630540812356 = 3535599^2 + 794066^2 .
It is a cyclic number.
It is not a de Polignac number, because 13131001101157 - 211 = 13131001099109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13131001102157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565500550578 + 6565500550579.
It is an arithmetic number, because the mean of its divisors is an integer number (6565500550579).
Almost surely, 213131001101157 is an apocalyptic number.
It is an amenable number.
13131001101157 is a deficient number, since it is larger than the sum of its proper divisors (1).
13131001101157 is an equidigital number, since it uses as much as digits as its factorization.
13131001101157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 315, while the sum is 25.
Adding to 13131001101157 its reverse (75110110013131), we get a palindrome (88241111114288).
The spelling of 13131001101157 in words is "thirteen trillion, one hundred thirty-one billion, one million, one hundred one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •