Base | Representation |
---|---|
bin | 11110101110001000100… |
… | …100000111001010000010 |
3 | 21110211011120221022200111 |
4 | 132232020210013022002 |
5 | 234042033222011320 |
6 | 4253500222341534 |
7 | 305344344566656 |
oct | 36561044071202 |
9 | 7424146838614 |
10 | 2111120110210 |
11 | 7443592a1311 |
12 | 2a1195a2a8aa |
13 | 124101b33587 |
14 | 74270728a66 |
15 | 39dad5cea5a |
hex | 1eb88907282 |
2111120110210 has 8 divisors (see below), whose sum is σ = 3800016198396. Its totient is φ = 844448044080.
The previous prime is 2111120110207. The next prime is 2111120110213. The reversal of 2111120110210 is 120110211112.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2111120110207) and next prime (2111120110213).
It can be written as a sum of positive squares in 2 ways, for example, as 2031340413001 + 79779697209 = 1425251^2 + 282453^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (2111120110213) 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 3 ways as a sum of consecutive naturals, for example, 105556005501 + ... + 105556005520.
Almost surely, 22111120110210 is an apocalyptic number.
2111120110210 is a deficient number, since it is larger than the sum of its proper divisors (1688896088186).
2111120110210 is a wasteful number, since it uses less digits than its factorization.
2111120110210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211112011028.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 2111120110210 its reverse (120110211112), we get a palindrome (2231230321322).
The spelling of 2111120110210 in words is "two trillion, one hundred eleven billion, one hundred twenty million, one hundred ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •