Base | Representation |
---|---|
bin | 11101010000111111001… |
… | …000111110001110000111 |
3 | 21010021000022000001200001 |
4 | 131100333020332032013 |
5 | 230422220111324033 |
6 | 4135515522302131 |
7 | 265204014020263 |
oct | 35207710761607 |
9 | 7107008001601 |
10 | 2011104011143 |
11 | 7059a486a7a7 |
12 | 2859227b7947 |
13 | 117852ba8176 |
14 | 6d4a34b70a3 |
15 | 374a7c64e7d |
hex | 1d43f23e387 |
2011104011143 has 2 divisors, whose sum is σ = 2011104011144. Its totient is φ = 2011104011142.
The previous prime is 2011104011101. The next prime is 2011104011149. The reversal of 2011104011143 is 3411104011102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2011104011143 - 29 = 2011104010631 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2011104011143.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011104011149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005552005571 + 1005552005572.
It is an arithmetic number, because the mean of its divisors is an integer number (1005552005572).
Almost surely, 22011104011143 is an apocalyptic number.
2011104011143 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011104011143 is an equidigital number, since it uses as much as digits as its factorization.
2011104011143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 2011104011143 its reverse (3411104011102), we get a palindrome (5422208022245).
It can be divided in two parts, 201110 and 4011143, that added together give a triangular number (4212253 = T2902).
The spelling of 2011104011143 in words is "two trillion, eleven billion, one hundred four million, eleven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •