Base | Representation |
---|---|
bin | 11110100100110011111… |
… | …010100101000110111111 |
3 | 21102212022222011010212002 |
4 | 132210303322211012333 |
5 | 233411033130031421 |
6 | 4245123035132515 |
7 | 304541315225231 |
oct | 36446372450677 |
9 | 7385288133762 |
10 | 2101110002111 |
11 | 7400919029aa |
12 | 29b2615a413b |
13 | 1231980172a3 |
14 | 739a10d4251 |
15 | 399c48c6b0b |
hex | 1e933ea51bf |
2101110002111 has 4 divisors (see below), whose sum is σ = 2101112922000. Its totient is φ = 2101107082224.
The previous prime is 2101110001973. The next prime is 2101110002143. The reversal of 2101110002111 is 1112000111012.
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-2101110002111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2101110002092 and 2101110002101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101110002161) 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, 468755 + ... + 2102843.
It is an arithmetic number, because the mean of its divisors is an integer number (525278230500).
Almost surely, 22101110002111 is an apocalyptic number.
2101110002111 is a deficient number, since it is larger than the sum of its proper divisors (2919889).
2101110002111 is a wasteful number, since it uses less digits than its factorization.
2101110002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2919888.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2101110002111 its reverse (1112000111012), we get a palindrome (3213110113123).
The spelling of 2101110002111 in words is "two trillion, one hundred one billion, one hundred ten million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •