Base | Representation |
---|---|
bin | 1010000110001010110110… |
… | …1110011000101110100001 |
3 | 1110022020220110011111202102 |
4 | 2201202231232120232201 |
5 | 2423340033142024022 |
6 | 35335440220100145 |
7 | 2224012600016414 |
oct | 241425556305641 |
9 | 43266813144672 |
10 | 11101110111137 |
11 | 359aa55285a32 |
12 | 12b3577394655 |
13 | 626aa3c14797 |
14 | 2a5421c07b7b |
15 | 143b730c5a92 |
hex | a18adb98ba1 |
11101110111137 has 2 divisors, whose sum is σ = 11101110111138. Its totient is φ = 11101110111136.
The previous prime is 11101110111059. The next prime is 11101110111149. The reversal of 11101110111137 is 73111101110111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6189939985681 + 4911170125456 = 2487959^2 + 2216116^2 .
It is an emirp because it is prime and its reverse (73111101110111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11101110111137 - 210 = 11101110110113 is a prime.
It is not a weakly prime, because it can be changed into another prime (11101110111167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550555055568 + 5550555055569.
It is an arithmetic number, because the mean of its divisors is an integer number (5550555055569).
Almost surely, 211101110111137 is an apocalyptic number.
It is an amenable number.
11101110111137 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101110111137 is an equidigital number, since it uses as much as digits as its factorization.
11101110111137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21, while the sum is 20.
Adding to 11101110111137 its reverse (73111101110111), we get a palindrome (84212211221248).
The spelling of 11101110111137 in words is "eleven trillion, one hundred one billion, one hundred ten million, one hundred eleven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •