Base | Representation |
---|---|
bin | 1010000000110111011100… |
… | …1000111001100001110101 |
3 | 1102222112201211102101000001 |
4 | 2200031313020321201311 |
5 | 2420341440000014031 |
6 | 35225531342151301 |
7 | 2214306030611521 |
oct | 240156710714165 |
9 | 42875654371001 |
10 | 11010000001141 |
11 | 3565350a74869 |
12 | 129998a882531 |
13 | 61b314111bab |
14 | 2a0c5b6d8d81 |
15 | 1415de567861 |
hex | a0377239875 |
11010000001141 has 2 divisors, whose sum is σ = 11010000001142. Its totient is φ = 11010000001140.
The previous prime is 11010000001069. The next prime is 11010000001153. The reversal of 11010000001141 is 14110000001011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7490736560241 + 3519263440900 = 2736921^2 + 1875970^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010000001141 - 229 = 11009463130229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010000001841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505000000570 + 5505000000571.
It is an arithmetic number, because the mean of its divisors is an integer number (5505000000571).
Almost surely, 211010000001141 is an apocalyptic number.
It is an amenable number.
11010000001141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010000001141 is an equidigital number, since it uses as much as digits as its factorization.
11010000001141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11010000001141 its reverse (14110000001011), we get a palindrome (25120000002152).
The spelling of 11010000001141 in words is "eleven trillion, ten billion, one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •