Base | Representation |
---|---|
bin | 1010000000111111101001… |
… | …0101011101101001011111 |
3 | 1102222202102020012021212111 |
4 | 2200033322111131221133 |
5 | 2420410441441010421 |
6 | 35230534011414451 |
7 | 2214414416000035 |
oct | 240177225355137 |
9 | 42882366167774 |
10 | 11012201110111 |
11 | 3566280491593 |
12 | 129a2a3a54427 |
13 | 61b5a5141236 |
14 | 2a0dc9b84555 |
15 | 1416bc902ee1 |
hex | a03fa55da5f |
11012201110111 has 16 divisors (see below), whose sum is σ = 11205576968800. Its totient is φ = 10819244131200.
The previous prime is 11012201110103. The next prime is 11012201110151. The reversal of 11012201110111 is 11101110221011.
It is a cyclic number.
It is not a de Polignac number, because 11012201110111 - 23 = 11012201110103 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11012201110091 and 11012201110100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012201110151) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 363916300 + ... + 363946558.
It is an arithmetic number, because the mean of its divisors is an integer number (700348560550).
Almost surely, 211012201110111 is an apocalyptic number.
11012201110111 is a deficient number, since it is larger than the sum of its proper divisors (193375858689).
11012201110111 is a wasteful number, since it uses less digits than its factorization.
11012201110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36970.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11012201110111 its reverse (11101110221011), we get a palindrome (22113311331122).
It can be divided in two parts, 110 and 12201110111, that added together give a palindrome (12201110221).
The spelling of 11012201110111 in words is "eleven trillion, twelve billion, two hundred one million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •