Base | Representation |
---|---|
bin | 11101010000111111100… |
… | …000001101000010000011 |
3 | 21010021000201110110112212 |
4 | 131100333200031002003 |
5 | 230422223141213443 |
6 | 4135520301012335 |
7 | 265204116543314 |
oct | 35207740150203 |
9 | 7107021413485 |
10 | 2011110101123 |
11 | 7059a824a242 |
12 | 2859248540ab |
13 | 11785422b0c6 |
14 | 6d4a422060b |
15 | 374a8569618 |
hex | 1d43f80d083 |
2011110101123 has 4 divisors (see below), whose sum is σ = 2011114797120. Its totient is φ = 2011105405128.
The previous prime is 2011110100973. The next prime is 2011110101129. The reversal of 2011110101123 is 3211010111102.
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 2011110101123 - 228 = 2010841665667 is a prime.
It is a super-2 number, since 2×20111101011232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011110101098 and 2011110101107.
It is not an unprimeable number, because it can be changed into a prime (2011110101129) 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, 1633040 + ... + 2586317.
It is an arithmetic number, because the mean of its divisors is an integer number (502778699280).
Almost surely, 22011110101123 is an apocalyptic number.
2011110101123 is a deficient number, since it is larger than the sum of its proper divisors (4695997).
2011110101123 is an equidigital number, since it uses as much as digits as its factorization.
2011110101123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4695996.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 2011110101123 its reverse (3211010111102), we get a palindrome (5222120212225).
The spelling of 2011110101123 in words is "two trillion, eleven billion, one hundred ten million, one hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •