Base | Representation |
---|---|
bin | 11110101110000010000… |
… | …111101101000101100101 |
3 | 21110210220001111202111101 |
4 | 132232002013231011211 |
5 | 234041323033000401 |
6 | 4253441401240101 |
7 | 305341562636104 |
oct | 36560207550545 |
9 | 7423801452441 |
10 | 2111012000101 |
11 | 744303270614 |
12 | 2a1165793031 |
13 | 1240b56104b4 |
14 | 7426022603b |
15 | 39da3d77101 |
hex | 1eb821ed165 |
2111012000101 has 4 divisors (see below), whose sum is σ = 2118524498604. Its totient is φ = 2103499501600.
The previous prime is 2111012000081. The next prime is 2111012000129. The reversal of 2111012000101 is 1010002101112.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1792465768900 + 318546231201 = 1338830^2 + 564399^2 .
It is a cyclic number.
It is not a de Polignac number, because 2111012000101 - 219 = 2111011475813 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2111012000191) 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, 3756248830 + ... + 3756249391.
It is an arithmetic number, because the mean of its divisors is an integer number (529631124651).
Almost surely, 22111012000101 is an apocalyptic number.
It is an amenable number.
2111012000101 is a deficient number, since it is larger than the sum of its proper divisors (7512498503).
2111012000101 is an equidigital number, since it uses as much as digits as its factorization.
2111012000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7512498502.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 2111012000101 its reverse (1010002101112), we get a palindrome (3121014101213).
The spelling of 2111012000101 in words is "two trillion, one hundred eleven billion, twelve million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •