Base | Representation |
---|---|
bin | 111110111100101… |
… | …1100110010001111 |
3 | 12110012111111022012 |
4 | 1331321130302033 |
5 | 13311211241421 |
6 | 545332011435 |
7 | 103225335542 |
oct | 17571346217 |
9 | 5405444265 |
10 | 2112212111 |
11 | 99431a249 |
12 | 4ab460b7b |
13 | 2787a5569 |
14 | 160748859 |
15 | c567a95b |
hex | 7de5cc8f |
2112212111 has 4 divisors (see below), whose sum is σ = 2112715800. Its totient is φ = 2111708424.
The previous prime is 2112212099. The next prime is 2112212117. The reversal of 2112212111 is 1112122112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2112212111 is a prime.
It is a super-2 number, since 2×21122121112 = 8922880003710152642, which contains 22 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 (2112212117) 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, 245501 + ... + 253958.
It is an arithmetic number, because the mean of its divisors is an integer number (528178950).
Almost surely, 22112212111 is an apocalyptic number.
2112212111 is a deficient number, since it is larger than the sum of its proper divisors (503689).
2112212111 is an equidigital number, since it uses as much as digits as its factorization.
2112212111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 503688.
The product of its digits is 16, while the sum is 14.
The square root of 2112212111 is about 45958.8088509700. The cubic root of 2112212111 is about 1283.0566821586.
Adding to 2112212111 its reverse (1112122112), we get a palindrome (3224334223).
It can be divided in two parts, 21122 and 12111, that added together give a palindrome (33233).
The spelling of 2112212111 in words is "two billion, one hundred twelve million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •