Base | Representation |
---|---|
bin | 11110101110010011011… |
… | …110111110011110011111 |
3 | 21110211122100200000002112 |
4 | 132232103132332132133 |
5 | 234042422122011221 |
6 | 4253530325144235 |
7 | 305352031025543 |
oct | 36562336763637 |
9 | 7424570600075 |
10 | 2111303313311 |
11 | 744442751535 |
12 | 2a122725b07b |
13 | 124130a8938a |
14 | 7428abb7a23 |
15 | 39dbe71c15b |
hex | 1eb937be79f |
2111303313311 has 8 divisors (see below), whose sum is σ = 2136816025344. Its totient is φ = 2085792394840.
The previous prime is 2111303313281. The next prime is 2111303313389. The reversal of 2111303313311 is 1133133031112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2111303313311 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 (2111303513311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2000456 + ... + 2867826.
It is an arithmetic number, because the mean of its divisors is an integer number (267102003168).
Almost surely, 22111303313311 is an apocalyptic number.
2111303313311 is a deficient number, since it is larger than the sum of its proper divisors (25512712033).
2111303313311 is an equidigital number, since it uses as much as digits as its factorization.
2111303313311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 896781.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 2111303313311 its reverse (1133133031112), we get a palindrome (3244436344423).
The spelling of 2111303313311 in words is "two trillion, one hundred eleven billion, three hundred three million, three hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •