Base | Representation |
---|---|
bin | 1100010110100000111… |
… | …1001110111000110111 |
3 | 202021201201220202001122 |
4 | 3011220033032320313 |
5 | 11434042232033421 |
6 | 241252342014155 |
7 | 21221366055446 |
oct | 3055017167067 |
9 | 667651822048 |
10 | 212202221111 |
11 | 81aa3692561 |
12 | 3516211735b |
13 | 1701a337c5a |
14 | a3b08dcd5d |
15 | 57be83c2ab |
hex | 31683cee37 |
212202221111 has 4 divisors (see below), whose sum is σ = 212203142424. Its totient is φ = 212201299800.
The previous prime is 212202221087. The next prime is 212202221131. The reversal of 212202221111 is 111122202212.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212202221111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 212202221111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212202221131) 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, 228356 + ... + 690326.
It is an arithmetic number, because the mean of its divisors is an integer number (53050785606).
Almost surely, 2212202221111 is an apocalyptic number.
212202221111 is a deficient number, since it is larger than the sum of its proper divisors (921313).
212202221111 is an equidigital number, since it uses as much as digits as its factorization.
212202221111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 921312.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 212202221111 its reverse (111122202212), we get a palindrome (323324423323).
The spelling of 212202221111 in words is "two hundred twelve billion, two hundred two million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •