Base | Representation |
---|---|
bin | 1010000110001010110110… |
… | …1110000000000011000011 |
3 | 1110022020220102222101002111 |
4 | 2201202231232000003003 |
5 | 2423340033130310201 |
6 | 35335440214000151 |
7 | 2224012566115615 |
oct | 241425556000303 |
9 | 43266812871074 |
10 | 11101110010051 |
11 | 359aa55216a96 |
12 | 12b3577346057 |
13 | 626aa3baa779 |
14 | 2a5421bbcdb5 |
15 | 143b730a5b51 |
hex | a18adb800c3 |
11101110010051 has 2 divisors, whose sum is σ = 11101110010052. Its totient is φ = 11101110010050.
The previous prime is 11101110009943. The next prime is 11101110010079. The reversal of 11101110010051 is 15001001110111.
It is a strong prime.
It is an emirp because it is prime and its reverse (15001001110111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11101110010051 - 233 = 11092520075459 is a prime.
It is not a weakly prime, because it can be changed into another prime (11101110010351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550555005025 + 5550555005026.
It is an arithmetic number, because the mean of its divisors is an integer number (5550555005026).
Almost surely, 211101110010051 is an apocalyptic number.
11101110010051 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101110010051 is an equidigital number, since it uses as much as digits as its factorization.
11101110010051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5, while the sum is 13.
Adding to 11101110010051 its reverse (15001001110111), we get a palindrome (26102111120162).
The spelling of 11101110010051 in words is "eleven trillion, one hundred one billion, one hundred ten million, ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •