Base | Representation |
---|---|
bin | 1010000000010101111111… |
… | …1101001001011101011111 |
3 | 1102221200120002001110001102 |
4 | 2200011133331021131133 |
5 | 2420220042401010421 |
6 | 35221444353303315 |
7 | 2213540362365614 |
oct | 240053775113537 |
9 | 42850502043042 |
10 | 11001021110111 |
11 | 356156369106a |
12 | 12980a3864b3b |
13 | 61a512b42a16 |
14 | 2a064901a50b |
15 | 14126615a60b |
hex | a015ff4975f |
11001021110111 has 4 divisors (see below), whose sum is σ = 11479326375792. Its totient is φ = 10522715844432.
The previous prime is 11001021110017. The next prime is 11001021110129. The reversal of 11001021110111 is 11101112010011.
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 11001021110111 - 222 = 11001016915807 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11001021110092 and 11001021110101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001021110171) 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, 239152632806 + ... + 239152632851.
It is an arithmetic number, because the mean of its divisors is an integer number (2869831593948).
Almost surely, 211001021110111 is an apocalyptic number.
11001021110111 is a deficient number, since it is larger than the sum of its proper divisors (478305265681).
11001021110111 is an equidigital number, since it uses as much as digits as its factorization.
11001021110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478305265680.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 11001021110111 its reverse (11101112010011), we get a palindrome (22102133120122).
The spelling of 11001021110111 in words is "eleven trillion, one billion, twenty-one million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •