Base | Representation |
---|---|
bin | 1010000111111010100111… |
… | …1000000100010011000111 |
3 | 1110102010100012211120102222 |
4 | 2201332221320010103013 |
5 | 2424333003214423421 |
6 | 35401321140322555 |
7 | 2226124201350320 |
oct | 241765170042307 |
9 | 43363305746388 |
10 | 11131110311111 |
11 | 360174a64622a |
12 | 12b934a3a345b |
13 | 6298753498bb |
14 | 2a6a6a2a5447 |
15 | 14482bc3dcab |
hex | a1fa9e044c7 |
11131110311111 has 8 divisors (see below), whose sum is σ = 12936883655040. Its totient is φ = 9379240649208.
The previous prime is 11131110311077. The next prime is 11131110311149. The reversal of 11131110311111 is 11111301113111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11131110311111 - 230 = 11130036569287 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11131110311111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11131110311011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13475920061 + ... + 13475920886.
It is an arithmetic number, because the mean of its divisors is an integer number (1617110456880).
Almost surely, 211131110311111 is an apocalyptic number.
11131110311111 is a deficient number, since it is larger than the sum of its proper divisors (1805773343929).
11131110311111 is an equidigital number, since it uses as much as digits as its factorization.
11131110311111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26951841013.
The product of its (nonzero) digits is 9, while the sum is 17.
Adding to 11131110311111 its reverse (11111301113111), we get a palindrome (22242411424222).
The spelling of 11131110311111 in words is "eleven trillion, one hundred thirty-one billion, one hundred ten million, three hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •