Base | Representation |
---|---|
bin | 1010000011001100110101… |
… | …0010011100110001000011 |
3 | 1110010101020110201222010021 |
4 | 2200303031102130301003 |
5 | 2422021101103113021 |
6 | 35300202413314311 |
7 | 2220225531453100 |
oct | 240631522346103 |
9 | 43111213658107 |
10 | 11050100051011 |
11 | 358035944884a |
12 | 12a5700195997 |
13 | 622034b24858 |
14 | 2a2b832abaa7 |
15 | 142689c13c41 |
hex | a0ccd49cc43 |
11050100051011 has 48 divisors (see below), whose sum is σ = 13125028534272. Its totient is φ = 9273830227200.
The previous prime is 11050100050879. The next prime is 11050100051017. The reversal of 11050100051011 is 11015000105011.
It is not a de Polignac number, because 11050100051011 - 217 = 11050099919939 is a prime.
It is a super-2 number, since 2×110501000510112 (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 (11050100051017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 383443275 + ... + 383472091.
It is an arithmetic number, because the mean of its divisors is an integer number (273438094464).
Almost surely, 211050100051011 is an apocalyptic number.
11050100051011 is a deficient number, since it is larger than the sum of its proper divisors (2074928483261).
11050100051011 is a wasteful number, since it uses less digits than its factorization.
11050100051011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29600 (or 29593 counting only the distinct ones).
The product of its (nonzero) digits is 25, while the sum is 16.
Adding to 11050100051011 its reverse (11015000105011), we get a palindrome (22065100156022).
The spelling of 11050100051011 in words is "eleven trillion, fifty billion, one hundred million, fifty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •