Base | Representation |
---|---|
bin | 111111001100000… |
… | …0000000110110111 |
3 | 12110202120101120211 |
4 | 1332120000012313 |
5 | 13320234033421 |
6 | 550215410251 |
7 | 103353403441 |
oct | 17630000667 |
9 | 5422511524 |
10 | 2120221111 |
11 | 99889a558 |
12 | 4b2083987 |
13 | 27a34ab08 |
14 | 161831491 |
15 | c620d9e1 |
hex | 7e6001b7 |
2120221111 has 4 divisors (see below), whose sum is σ = 2121085800. Its totient is φ = 2119356424.
The previous prime is 2120221073. The next prime is 2120221123. The reversal of 2120221111 is 1111220212.
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 2120221111 - 217 = 2120090039 is a prime.
It is a super-4 number, since 4×21202211114 (a number of 38 digits) contains 4444 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2120221091 and 2120221100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2120221141) 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, 428656 + ... + 433573.
It is an arithmetic number, because the mean of its divisors is an integer number (530271450).
Almost surely, 22120221111 is an apocalyptic number.
2120221111 is a deficient number, since it is larger than the sum of its proper divisors (864689).
2120221111 is an equidigital number, since it uses as much as digits as its factorization.
2120221111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 864688.
The product of its (nonzero) digits is 16, while the sum is 13.
The square root of 2120221111 is about 46045.8587823053. The cubic root of 2120221111 is about 1284.6763175106.
Adding to 2120221111 its reverse (1111220212), we get a palindrome (3231441323).
The spelling of 2120221111 in words is "two billion, one hundred twenty million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •