Base | Representation |
---|---|
bin | 1100001110101110101… |
… | …0100000101111001111 |
3 | 202002100002012200200012 |
4 | 3003223222200233033 |
5 | 11420302212020421 |
6 | 240305122023435 |
7 | 21115530255203 |
oct | 3035352405717 |
9 | 662302180605 |
10 | 210112220111 |
11 | 81120963902 |
12 | 3487a1a7b7b |
13 | 16a7633b381 |
14 | a2530d6b03 |
15 | 56eb0ec95b |
hex | 30ebaa0bcf |
210112220111 has 4 divisors (see below), whose sum is σ = 212192539224. Its totient is φ = 208031901000.
The previous prime is 210112220107. The next prime is 210112220113. The reversal of 210112220111 is 111022211012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 210112220111 - 22 = 210112220107 is a prime.
It is a super-3 number, since 3×2101122201113 (a number of 35 digits) contains 333 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 (210112220113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1040159405 + ... + 1040159606.
It is an arithmetic number, because the mean of its divisors is an integer number (53048134806).
Almost surely, 2210112220111 is an apocalyptic number.
210112220111 is a deficient number, since it is larger than the sum of its proper divisors (2080319113).
210112220111 is a wasteful number, since it uses less digits than its factorization.
210112220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2080319112.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 210112220111 its reverse (111022211012), we get a palindrome (321134431123).
Subtracting from 210112220111 its reverse (111022211012), we obtain a palindrome (99090009099).
The spelling of 210112220111 in words is "two hundred ten billion, one hundred twelve million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •