Base | Representation |
---|---|
bin | 11110110110100000011… |
… | …110000001010010110111 |
3 | 21111200101012001222112111 |
4 | 132312200132001102313 |
5 | 234213441420213421 |
6 | 4301544322431451 |
7 | 306113221006303 |
oct | 36664036012267 |
9 | 7450335058474 |
10 | 2120111101111 |
11 | 748152499903 |
12 | 2a2a84b02587 |
13 | 124c0577b033 |
14 | 74884876d03 |
15 | 3a237acbee1 |
hex | 1eda07814b7 |
2120111101111 has 16 divisors (see below), whose sum is σ = 2204555673600. Its totient is φ = 2036714788800.
The previous prime is 2120111101093. The next prime is 2120111101123. The reversal of 2120111101111 is 1111011110212.
It is a cyclic number.
It is not a de Polignac number, because 2120111101111 - 215 = 2120111068343 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2120111101091 and 2120111101100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2120111105111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2462395 + ... + 3209923.
It is an arithmetic number, because the mean of its divisors is an integer number (137784729600).
Almost surely, 22120111101111 is an apocalyptic number.
2120111101111 is a deficient number, since it is larger than the sum of its proper divisors (84444572489).
2120111101111 is a wasteful number, since it uses less digits than its factorization.
2120111101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 748230.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 2120111101111 its reverse (1111011110212), we get a palindrome (3231122211323).
It can be divided in two parts, 2120111 and 101111, that added together give a palindrome (2221222).
The spelling of 2120111101111 in words is "two trillion, one hundred twenty billion, one hundred eleven million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •