Base | Representation |
---|---|
bin | 1010000110001010011111… |
… | …0000111010011010111011 |
3 | 1110022020122110222221011202 |
4 | 2201202213300322122323 |
5 | 2423334332042011024 |
6 | 35335422244444415 |
7 | 2224010244021335 |
oct | 241424760723273 |
9 | 43266573887152 |
10 | 11101010110139 |
11 | 359aa03893784 |
12 | 12b35499a970b |
13 | 626a892a06b1 |
14 | 2a5412816455 |
15 | 143b69420bae |
hex | a18a7c3a6bb |
11101010110139 has 2 divisors, whose sum is σ = 11101010110140. Its totient is φ = 11101010110138.
The previous prime is 11101010110039. The next prime is 11101010110187. The reversal of 11101010110139 is 93101101010111.
It is a strong prime.
It is an emirp because it is prime and its reverse (93101101010111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11101010110139 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11101010110139.
It is not a weakly prime, because it can be changed into another prime (11101010110039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550505055069 + 5550505055070.
It is an arithmetic number, because the mean of its divisors is an integer number (5550505055070).
Almost surely, 211101010110139 is an apocalyptic number.
11101010110139 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101010110139 is an equidigital number, since it uses as much as digits as its factorization.
11101010110139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 20.
The spelling of 11101010110139 in words is "eleven trillion, one hundred one billion, ten million, one hundred ten thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •