Base | Representation |
---|---|
bin | 1010000110000110110000… |
… | …1010001110000010000111 |
3 | 1110022011001210022201101201 |
4 | 2201201230022032002013 |
5 | 2423330310042023421 |
6 | 35335135123203331 |
7 | 2223643412123305 |
oct | 241415412160207 |
9 | 43264053281351 |
10 | 11100010111111 |
11 | 359a5403706a9 |
12 | 12b330ab16547 |
13 | 62695a063aac |
14 | 2a5359aa9275 |
15 | 143b0b73eb91 |
hex | a186c28e087 |
11100010111111 has 4 divisors (see below), whose sum is σ = 11100403603224. Its totient is φ = 11099616619000.
The previous prime is 11100010111079. The next prime is 11100010111163. The reversal of 11100010111111 is 11111101000111.
It is a happy number.
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 11100010111111 - 25 = 11100010111079 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 (11100010121111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 196703740 + ... + 196760161.
It is an arithmetic number, because the mean of its divisors is an integer number (2775100900806).
Almost surely, 211100010111111 is an apocalyptic number.
11100010111111 is a deficient number, since it is larger than the sum of its proper divisors (393492113).
11100010111111 is an equidigital number, since it uses as much as digits as its factorization.
11100010111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 393492112.
The product of its (nonzero) digits is 1, while the sum is 10.
Adding to 11100010111111 its reverse (11111101000111), we get a palindrome (22211111111222).
The spelling of 11100010111111 in words is "eleven trillion, one hundred billion, ten million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •