Base | Representation |
---|---|
bin | 11110101101010001110… |
… | …010011100100101010111 |
3 | 21110201210112200211122012 |
4 | 132231101302130211113 |
5 | 234033142441333421 |
6 | 4253225113254435 |
7 | 305312515402316 |
oct | 36552162344527 |
9 | 7421715624565 |
10 | 2110201121111 |
11 | 743a2757a196 |
12 | 2a0b7a10441b |
13 | 123cb661b945 |
14 | 741c466827d |
15 | 39d57aa195b |
hex | 1eb51c9c957 |
2110201121111 has 16 divisors (see below), whose sum is σ = 2161646767104. Its totient is φ = 2058864411744.
The previous prime is 2110201120987. The next prime is 2110201121131. The reversal of 2110201121111 is 1111211020112.
It is a cyclic number.
It is not a de Polignac number, because 2110201121111 - 214 = 2110201104727 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2110201121131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 291179090 + ... + 291186336.
It is an arithmetic number, because the mean of its divisors is an integer number (135102922944).
Almost surely, 22110201121111 is an apocalyptic number.
2110201121111 is a deficient number, since it is larger than the sum of its proper divisors (51445645993).
2110201121111 is a wasteful number, since it uses less digits than its factorization.
2110201121111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13790.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 2110201121111 its reverse (1111211020112), we get a palindrome (3221412141223).
It can be divided in two parts, 211020112 and 1111, that multiplied together give a palindrome (234443344432).
The spelling of 2110201121111 in words is "two trillion, one hundred ten billion, two hundred one million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •