Base | Representation |
---|---|
bin | 11110101110001000100… |
… | …011101100100001001101 |
3 | 21110211011120201210000102 |
4 | 132232020203230201031 |
5 | 234042033210013401 |
6 | 4253500220140445 |
7 | 305344343633606 |
oct | 36561043544115 |
9 | 7424146653012 |
10 | 2111120001101 |
11 | 744359227341 |
12 | 2a1195997725 |
13 | 124101ac5a07 |
14 | 742706dadad |
15 | 39dad5ac56b |
hex | 1eb888ec84d |
2111120001101 has 8 divisors (see below), whose sum is σ = 2113276679064. Its totient is φ = 2108964320320.
The previous prime is 2111120001083. The next prime is 2111120001121. The reversal of 2111120001101 is 1011000211112.
It can be written as a sum of positive squares in 4 ways, for example, as 600369277225 + 1510750723876 = 774835^2 + 1229126^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2111120001101 - 226 = 2111052892237 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2111120001121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4024355 + ... + 4518591.
It is an arithmetic number, because the mean of its divisors is an integer number (264159584883).
Almost surely, 22111120001101 is an apocalyptic number.
It is an amenable number.
2111120001101 is a deficient number, since it is larger than the sum of its proper divisors (2156677963).
2111120001101 is a wasteful number, since it uses less digits than its factorization.
2111120001101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 498591.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2111120001101 its reverse (1011000211112), we get a palindrome (3122120212213).
The spelling of 2111120001101 in words is "two trillion, one hundred eleven billion, one hundred twenty million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •