Base | Representation |
---|---|
bin | 1011110110100001000010… |
… | …1100111110010100110101 |
3 | 1201010202211111111122220201 |
4 | 2331220100230332110311 |
5 | 3202000410004014031 |
6 | 43414242232400501 |
7 | 2513321361624664 |
oct | 275502054762465 |
9 | 51122744448821 |
10 | 13031211001141 |
11 | 4174561983913 |
12 | 1565652246131 |
13 | 736ab7bc7128 |
14 | 3309dd224ddb |
15 | 178e89770d61 |
hex | bda10b3e535 |
13031211001141 has 2 divisors, whose sum is σ = 13031211001142. Its totient is φ = 13031211001140.
The previous prime is 13031211001099. The next prime is 13031211001147. The reversal of 13031211001141 is 14110011213031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12959488805041 + 71722196100 = 3599929^2 + 267810^2 .
It is a cyclic number.
It is not a de Polignac number, because 13031211001141 - 233 = 13022621066549 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13031211001147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6515605500570 + 6515605500571.
It is an arithmetic number, because the mean of its divisors is an integer number (6515605500571).
Almost surely, 213031211001141 is an apocalyptic number.
It is an amenable number.
13031211001141 is a deficient number, since it is larger than the sum of its proper divisors (1).
13031211001141 is an equidigital number, since it uses as much as digits as its factorization.
13031211001141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 13031211001141 its reverse (14110011213031), we get a palindrome (27141222214172).
The spelling of 13031211001141 in words is "thirteen trillion, thirty-one billion, two hundred eleven million, one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •