Base | Representation |
---|---|
bin | 1010000011001110010101… |
… | …1011011100000010111011 |
3 | 1110010102021200211120202011 |
4 | 2200303211123130002323 |
5 | 2422022413243414124 |
6 | 35300310522150351 |
7 | 2220241550130640 |
oct | 240634533340273 |
9 | 43112250746664 |
10 | 11050505060539 |
11 | 358054702546a |
12 | 12a57b39523b7 |
13 | 62209a9cb369 |
14 | 2a2bc0db7dc7 |
15 | 1426b0566994 |
hex | a0ce56dc0bb |
11050505060539 has 4 divisors (see below), whose sum is σ = 12629148640624. Its totient is φ = 9471861480456.
The previous prime is 11050505060533. The next prime is 11050505060563. The reversal of 11050505060539 is 93506050505011.
11050505060539 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11050505060539 - 237 = 10913066107067 is a prime.
It is a super-2 number, since 2×110505050605392 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11050505060533) 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, 789321790032 + ... + 789321790045.
It is an arithmetic number, because the mean of its divisors is an integer number (3157287160156).
Almost surely, 211050505060539 is an apocalyptic number.
11050505060539 is a deficient number, since it is larger than the sum of its proper divisors (1578643580085).
11050505060539 is an equidigital number, since it uses as much as digits as its factorization.
11050505060539 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1578643580084.
The product of its (nonzero) digits is 101250, while the sum is 40.
The spelling of 11050505060539 in words is "eleven trillion, fifty billion, five hundred five million, sixty thousand, five hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.374 sec. • engine limits •