Base | Representation |
---|---|
bin | 1010001100100001010000… |
… | …0011100001101000111111 |
3 | 1110200200111012010111111120 |
4 | 2203020110003201220333 |
5 | 2432131442441023403 |
6 | 35501521214522023 |
7 | 2234624143145121 |
oct | 243102403415077 |
9 | 43620435114446 |
10 | 11210201111103 |
11 | 3632246306945 |
12 | 1310741806313 |
13 | 63416acb6637 |
14 | 2aa8103ab211 |
15 | 14690a4b4e53 |
hex | a32140e1a3f |
11210201111103 has 16 divisors (see below), whose sum is σ = 15294900905856. Its totient is φ = 7299492611040.
The previous prime is 11210201111093. The next prime is 11210201111113. The reversal of 11210201111103 is 30111110201211.
It is an interprime number because it is at equal distance from previous prime (11210201111093) and next prime (11210201111113).
It is not a de Polignac number, because 11210201111103 - 28 = 11210201110847 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11210201111113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4542168 + ... + 6561378.
It is an arithmetic number, because the mean of its divisors is an integer number (955931306616).
Almost surely, 211210201111103 is an apocalyptic number.
11210201111103 is a deficient number, since it is larger than the sum of its proper divisors (4084699794753).
11210201111103 is a wasteful number, since it uses less digits than its factorization.
11210201111103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2062294.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 11210201111103 its reverse (30111110201211), we get a palindrome (41321311312314).
The spelling of 11210201111103 in words is "eleven trillion, two hundred ten billion, two hundred one million, one hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •