Base | Representation |
---|---|
bin | 10100101101101000… |
… | …01111000010110101 |
3 | 1001200222122012111101 |
4 | 22112310033002311 |
5 | 140233233210401 |
6 | 5035240410101 |
7 | 542366140420 |
oct | 122664170265 |
9 | 31628565441 |
10 | 11120210101 |
11 | 4797083490 |
12 | 21a4176931 |
13 | 1082ac60a0 |
14 | 776c429b7 |
15 | 4513d7101 |
hex | 296d0f0b5 |
11120210101 has 32 divisors (see below), whose sum is σ = 14940592128. Its totient is φ = 7993218240.
The previous prime is 11120210093. The next prime is 11120210111. The reversal of 11120210101 is 10101202111.
11120210101 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 11120210101 - 23 = 11120210093 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120210111) 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 31 ways as a sum of consecutive naturals, for example, 2086426 + ... + 2091748.
It is an arithmetic number, because the mean of its divisors is an integer number (466893504).
Almost surely, 211120210101 is an apocalyptic number.
11120210101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11120210101 is a deficient number, since it is larger than the sum of its proper divisors (3820382027).
11120210101 is a wasteful number, since it uses less digits than its factorization.
11120210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7441.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11120210101 its reverse (10101202111), we get a palindrome (21221412212).
The spelling of 11120210101 in words is "eleven billion, one hundred twenty million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •