Base | Representation |
---|---|
bin | 1010000001011111000011… |
… | …0011010110001000111111 |
3 | 1110000120011201201110101120 |
4 | 2200113300303112020333 |
5 | 2421030223030343421 |
6 | 35234450311442023 |
7 | 2215133340532614 |
oct | 240276063261077 |
9 | 43016151643346 |
10 | 11020631106111 |
11 | 3569906a52330 |
12 | 129ba57086313 |
13 | 61c319798b53 |
14 | 2a15895c050b |
15 | 141a12a398c6 |
hex | a05f0cd623f |
11020631106111 has 32 divisors (see below), whose sum is σ = 16317473794560. Its totient is φ = 6560387328000.
The previous prime is 11020631106049. The next prime is 11020631106131. The reversal of 11020631106111 is 11160113602011.
11020631106111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11020631106111 - 26 = 11020631106047 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020631106131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11981490 + ... + 12868463.
It is an arithmetic number, because the mean of its divisors is an integer number (509921056080).
Almost surely, 211020631106111 is an apocalyptic number.
11020631106111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11020631106111 is a deficient number, since it is larger than the sum of its proper divisors (5296842688449).
11020631106111 is a wasteful number, since it uses less digits than its factorization.
11020631106111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24850207.
The product of its (nonzero) digits is 216, while the sum is 24.
Adding to 11020631106111 its reverse (11160113602011), we get a palindrome (22180744708122).
The spelling of 11020631106111 in words is "eleven trillion, twenty billion, six hundred thirty-one million, one hundred six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •