Base | Representation |
---|---|
bin | 1011111011001010101110… |
… | …1001101010001101001111 |
3 | 1201102102002111102000102121 |
4 | 2332302223221222031033 |
5 | 3204303033210341421 |
6 | 43515055420033411 |
7 | 2522150530204312 |
oct | 276625351521517 |
9 | 51372074360377 |
10 | 13111120012111 |
11 | 41a5438493550 |
12 | 1579033692867 |
13 | 7414b1221a84 |
14 | 33481dc76979 |
15 | 17b0b4c69d41 |
hex | becaba6a34f |
13111120012111 has 4 divisors (see below), whose sum is σ = 14303040013224. Its totient is φ = 11919200011000.
The previous prime is 13111120012091. The next prime is 13111120012141. The reversal of 13111120012111 is 11121002111131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13111120012111 - 239 = 12561364198223 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111120012141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 595960000540 + ... + 595960000561.
It is an arithmetic number, because the mean of its divisors is an integer number (3575760003306).
Almost surely, 213111120012111 is an apocalyptic number.
13111120012111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13111120012111 is a deficient number, since it is larger than the sum of its proper divisors (1191920001113).
13111120012111 is a wasteful number, since it uses less digits than its factorization.
13111120012111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1191920001112.
The product of its (nonzero) digits is 12, while the sum is 16.
Adding to 13111120012111 its reverse (11121002111131), we get a palindrome (24232122123242).
The spelling of 13111120012111 in words is "thirteen trillion, one hundred eleven billion, one hundred twenty million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •