Base | Representation |
---|---|
bin | 1010000111111010101011… |
… | …0000111010110101001111 |
3 | 1110102010101020212202002221 |
4 | 2201332222300322311033 |
5 | 2424333021023331133 |
6 | 35401322432000211 |
7 | 2226124442131465 |
oct | 241765260726517 |
9 | 43363336782087 |
10 | 11131125214543 |
11 | 3601757aa5414 |
12 | 12b9353390067 |
13 | 6298784672b9 |
14 | 2a6a6c264835 |
15 | 14482d1d4a2d |
hex | a1faac3ad4f |
11131125214543 has 2 divisors, whose sum is σ = 11131125214544. Its totient is φ = 11131125214542.
The previous prime is 11131125214541. The next prime is 11131125214549. The reversal of 11131125214543 is 34541252113111.
It is a weak prime.
It is an emirp because it is prime and its reverse (34541252113111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11131125214543 - 21 = 11131125214541 is a prime.
Together with 11131125214541, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 11131125214499 and 11131125214508.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11131125214541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5565562607271 + 5565562607272.
It is an arithmetic number, because the mean of its divisors is an integer number (5565562607272).
Almost surely, 211131125214543 is an apocalyptic number.
11131125214543 is a deficient number, since it is larger than the sum of its proper divisors (1).
11131125214543 is an equidigital number, since it uses as much as digits as its factorization.
11131125214543 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14400, while the sum is 34.
Adding to 11131125214543 its reverse (34541252113111), we get a palindrome (45672377327654).
The spelling of 11131125214543 in words is "eleven trillion, one hundred thirty-one billion, one hundred twenty-five million, two hundred fourteen thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •