Base | Representation |
---|---|
bin | 1010100000010111000010… |
… | …0010010110000111111001 |
3 | 1111220021021220001201212222 |
4 | 2220011300202112013321 |
5 | 3003223030102020044 |
6 | 40322251555013425 |
7 | 2301351625301045 |
oct | 250056042260771 |
9 | 44807256051788 |
10 | 11551055110649 |
11 | 375385852472a |
12 | 1366808b9a275 |
13 | 65a34baa6372 |
14 | 2bd1072a1025 |
15 | 1507095ec8ee |
hex | a81708961f9 |
11551055110649 has 2 divisors, whose sum is σ = 11551055110650. Its totient is φ = 11551055110648.
The previous prime is 11551055110501. The next prime is 11551055110709. The reversal of 11551055110649 is 94601155015511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8790821764624 + 2760233346025 = 2964932^2 + 1661395^2 .
It is an emirp because it is prime and its reverse (94601155015511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11551055110649 - 212 = 11551055106553 is a prime.
It is not a weakly prime, because it can be changed into another prime (11551055110949) 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, 5775527555324 + 5775527555325.
It is an arithmetic number, because the mean of its divisors is an integer number (5775527555325).
Almost surely, 211551055110649 is an apocalyptic number.
It is an amenable number.
11551055110649 is a deficient number, since it is larger than the sum of its proper divisors (1).
11551055110649 is an equidigital number, since it uses as much as digits as its factorization.
11551055110649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135000, while the sum is 44.
The spelling of 11551055110649 in words is "eleven trillion, five hundred fifty-one billion, fifty-five million, one hundred ten thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •