Base | Representation |
---|---|
bin | 1010000011001110010101… |
… | …1011011001100110000101 |
3 | 1110010102021200211001222101 |
4 | 2200303211123121212011 |
5 | 2422022413243104001 |
6 | 35300310522032101 |
7 | 2220241550056450 |
oct | 240634533314605 |
9 | 43112250731871 |
10 | 11050505050501 |
11 | 3580547018974 |
12 | 12a57b3948631 |
13 | 62209a9c6917 |
14 | 2a2bc0db4497 |
15 | 1426b0563a01 |
hex | a0ce56d9985 |
11050505050501 has 16 divisors (see below), whose sum is σ = 13449334777344. Its totient is φ = 8863163115264.
The previous prime is 11050505050493. The next prime is 11050505050511. The reversal of 11050505050501 is 10505050505011.
It is not a de Polignac number, because 11050505050501 - 23 = 11050505050493 is a prime.
It is a super-2 number, since 2×110505050505012 (a number of 27 digits) contains 22 as substring.
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 11050505050501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11050505050511) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 268364925 + ... + 268406098.
It is an arithmetic number, because the mean of its divisors is an integer number (840583423584).
Almost surely, 211050505050501 is an apocalyptic number.
It is an amenable number.
11050505050501 is a deficient number, since it is larger than the sum of its proper divisors (2398829726843).
11050505050501 is a wasteful number, since it uses less digits than its factorization.
11050505050501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 536771220.
The product of its (nonzero) digits is 3125, while the sum is 28.
Adding to 11050505050501 its reverse (10505050505011), we get a palindrome (21555555555512).
The spelling of 11050505050501 in words is "eleven trillion, fifty billion, five hundred five million, fifty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •