Base | Representation |
---|---|
bin | 1010010101101100011000… |
… | …0001010011010010100011 |
3 | 1111020202021220221220112201 |
4 | 2211123012001103102203 |
5 | 2442222231224221024 |
6 | 40102144200034031 |
7 | 2252203552046245 |
oct | 245330601232243 |
9 | 44222256856481 |
10 | 11367805695139 |
11 | 3693071a58593 |
12 | 13371a7162917 |
13 | 645c96bb0c5a |
14 | 2b42c1ad6095 |
15 | 14aa819d4744 |
hex | a56c60534a3 |
11367805695139 has 2 divisors, whose sum is σ = 11367805695140. Its totient is φ = 11367805695138.
The previous prime is 11367805695107. The next prime is 11367805695143. The reversal of 11367805695139 is 93159650876311.
It is a strong prime.
It is an emirp because it is prime and its reverse (93159650876311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11367805695139 - 25 = 11367805695107 is a prime.
It is not a weakly prime, because it can be changed into another prime (11367805695179) 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, 5683902847569 + 5683902847570.
It is an arithmetic number, because the mean of its divisors is an integer number (5683902847570).
Almost surely, 211367805695139 is an apocalyptic number.
11367805695139 is a deficient number, since it is larger than the sum of its proper divisors (1).
11367805695139 is an equidigital number, since it uses as much as digits as its factorization.
11367805695139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36741600, while the sum is 64.
The spelling of 11367805695139 in words is "eleven trillion, three hundred sixty-seven billion, eight hundred five million, six hundred ninety-five thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •