Base | Representation |
---|---|
bin | 1010000111010010011000… |
… | …1100011011010101010111 |
3 | 1110101002110121020212220201 |
4 | 2201310212030123111113 |
5 | 2424143344121334424 |
6 | 35352333404241331 |
7 | 2225262450634615 |
oct | 241644614332527 |
9 | 43332417225821 |
10 | 11120311121239 |
11 | 35a81087a4021 |
12 | 12b7235840247 |
13 | 628843c01218 |
14 | 2a6323d486b5 |
15 | 1443e8b18d44 |
hex | a1d2631b557 |
11120311121239 has 2 divisors, whose sum is σ = 11120311121240. Its totient is φ = 11120311121238.
The previous prime is 11120311121159. The next prime is 11120311121299. The reversal of 11120311121239 is 93212111302111.
11120311121239 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (93212111302111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11120311121239 - 231 = 11118163637591 is a prime.
It is a super-2 number, since 2×111203111212392 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11120311121299) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560155560619 + 5560155560620.
It is an arithmetic number, because the mean of its divisors is an integer number (5560155560620).
Almost surely, 211120311121239 is an apocalyptic number.
11120311121239 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120311121239 is an equidigital number, since it uses as much as digits as its factorization.
11120311121239 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 28.
The spelling of 11120311121239 in words is "eleven trillion, one hundred twenty billion, three hundred eleven million, one hundred twenty-one thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •