Base | Representation |
---|---|
bin | 111110101001101… |
… | …0000011100101111 |
3 | 12102111122211102101 |
4 | 1331103100130233 |
5 | 13301130400421 |
6 | 544333235531 |
7 | 103044256204 |
oct | 17523203457 |
9 | 5374584371 |
10 | 2102200111 |
11 | 989701070 |
12 | 4a8032ba7 |
13 | 2766ab3bb |
14 | 15d29dcab |
15 | c484e191 |
hex | 7d4d072f |
2102200111 has 8 divisors (see below), whose sum is σ = 2372389200. Its totient is φ = 1845191040.
The previous prime is 2102200081. The next prime is 2102200141. The reversal of 2102200111 is 1110022012.
It is an interprime number because it is at equal distance from previous prime (2102200081) and next prime (2102200141).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2102200111 - 213 = 2102191919 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 (2102200141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3294666 + ... + 3295303.
It is an arithmetic number, because the mean of its divisors is an integer number (296548650).
Almost surely, 22102200111 is an apocalyptic number.
2102200111 is a deficient number, since it is larger than the sum of its proper divisors (270189089).
2102200111 is a wasteful number, since it uses less digits than its factorization.
2102200111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6590009.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 2102200111 is about 45849.7558444971. The cubic root of 2102200111 is about 1281.0262178399.
Adding to 2102200111 its reverse (1110022012), we get a palindrome (3212222123).
It can be divided in two parts, 21022001 and 11, that added together give a palindrome (21022012).
The spelling of 2102200111 in words is "two billion, one hundred two million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •