Base | Representation |
---|---|
bin | 1010000011001100100111… |
… | …1011110000100010111111 |
3 | 1110010101002112211122120001 |
4 | 2200303021323300202333 |
5 | 2422020442201133241 |
6 | 35300153043135131 |
7 | 2220224246211454 |
oct | 240631173604277 |
9 | 43111075748501 |
10 | 11050043771071 |
11 | 358032a6a88a8 |
12 | 12a56a53744a7 |
13 | 62202627ac06 |
14 | 2a2b79a1b82b |
15 | 142684ce8431 |
hex | a0cc9ef08bf |
11050043771071 has 16 divisors (see below), whose sum is σ = 11968427276640. Its totient is φ = 10169251747200.
The previous prime is 11050043771047. The next prime is 11050043771083. The reversal of 11050043771071 is 17017734005011.
It is a cyclic number.
It is not a de Polignac number, because 11050043771071 - 29 = 11050043770559 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11050043771071.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11050043771171) 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 in 15 ways as a sum of consecutive naturals, for example, 54221220 + ... + 54424633.
It is an arithmetic number, because the mean of its divisors is an integer number (748026704790).
Almost surely, 211050043771071 is an apocalyptic number.
11050043771071 is a deficient number, since it is larger than the sum of its proper divisors (918383505569).
11050043771071 is a wasteful number, since it uses less digits than its factorization.
11050043771071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108646026.
The product of its (nonzero) digits is 20580, while the sum is 37.
Adding to 11050043771071 its reverse (17017734005011), we get a palindrome (28067777776082).
The spelling of 11050043771071 in words is "eleven trillion, fifty billion, forty-three million, seven hundred seventy-one thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •