Base | Representation |
---|---|
bin | 10100101110111011… |
… | …11100110101000001 |
3 | 1001201202012210002112 |
4 | 22113131330311001 |
5 | 140244033124122 |
6 | 5040311025105 |
7 | 542561114231 |
oct | 122735746501 |
9 | 31652183075 |
10 | 11131145537 |
11 | 47a2272436 |
12 | 21a796b195 |
13 | 1085154665 |
14 | 77848bcc1 |
15 | 4523472e2 |
hex | 29777cd41 |
11131145537 has 2 divisors, whose sum is σ = 11131145538. Its totient is φ = 11131145536.
The previous prime is 11131145533. The next prime is 11131145549. The reversal of 11131145537 is 73554113111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9438316801 + 1692828736 = 97151^2 + 41144^2 .
It is a cyclic number.
It is not a de Polignac number, because 11131145537 - 22 = 11131145533 is a prime.
It is not a weakly prime, because it can be changed into another prime (11131145533) 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, 5565572768 + 5565572769.
It is an arithmetic number, because the mean of its divisors is an integer number (5565572769).
Almost surely, 211131145537 is an apocalyptic number.
It is an amenable number.
11131145537 is a deficient number, since it is larger than the sum of its proper divisors (1).
11131145537 is an equidigital number, since it uses as much as digits as its factorization.
11131145537 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6300, while the sum is 32.
Adding to 11131145537 its reverse (73554113111), we get a palindrome (84685258648).
The spelling of 11131145537 in words is "eleven billion, one hundred thirty-one million, one hundred forty-five thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •