Base | Representation |
---|---|
bin | 1010000110001110001011… |
… | …0001011101101000011111 |
3 | 1110022100012110212010211101 |
4 | 2201203202301131220133 |
5 | 2423343344012010421 |
6 | 35340104411533531 |
7 | 2224043624622541 |
oct | 241434261355037 |
9 | 43270173763741 |
10 | 11102000110111 |
11 | 35a03716a7379 |
12 | 12b378545a2a7 |
13 | 626bb6418cb1 |
14 | 2a54a80bd691 |
15 | 143bc62c9191 |
hex | a18e2c5da1f |
11102000110111 has 16 divisors (see below), whose sum is σ = 11743973785600. Its totient is φ = 10465834441248.
The previous prime is 11102000110037. The next prime is 11102000110129. The reversal of 11102000110111 is 11101100020111.
11102000110111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11102000110111 - 213 = 11102000101919 is a prime.
It is a super-2 number, since 2×111020001101112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102000110171) 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, 8901505 + ... + 10071781.
It is an arithmetic number, because the mean of its divisors is an integer number (733998361600).
Almost surely, 211102000110111 is an apocalyptic number.
11102000110111 is a deficient number, since it is larger than the sum of its proper divisors (641973675489).
11102000110111 is a wasteful number, since it uses less digits than its factorization.
11102000110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1172758.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 11102000110111 its reverse (11101100020111), we get a palindrome (22203100130222).
The spelling of 11102000110111 in words is "eleven trillion, one hundred two billion, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •