Base | Representation |
---|---|
bin | 100100011101011110101… |
… | …1101101101101111101111 |
3 | 122202001112220120120102222 |
4 | 1020322331131231233233 |
5 | 1124100223300104021 |
6 | 14354023350105555 |
7 | 1025016663611522 |
oct | 110727535555757 |
9 | 18661486516388 |
10 | 5011110550511 |
11 | 16622222a260a |
12 | 68b22a94b2bb |
13 | 2a4712b87700 |
14 | 1347791d2bb9 |
15 | 8a53cd4b6ab |
hex | 48ebd76dbef |
5011110550511 has 12 divisors (see below), whose sum is σ = 5500564095168. Its totient is φ = 4562275558464.
The previous prime is 5011110550477. The next prime is 5011110550519. The reversal of 5011110550511 is 1150550111105.
It is not a de Polignac number, because 5011110550511 - 230 = 5010036808687 is a prime.
It is a super-2 number, since 2×50111105505112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5011110550519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 203080415 + ... + 203105088.
It is an arithmetic number, because the mean of its divisors is an integer number (458380341264).
Almost surely, 25011110550511 is an apocalyptic number.
5011110550511 is a deficient number, since it is larger than the sum of its proper divisors (489453544657).
5011110550511 is a wasteful number, since it uses less digits than its factorization.
5011110550511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406185602 (or 406185589 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 26.
Adding to 5011110550511 its reverse (1150550111105), we get a palindrome (6161660661616).
The spelling of 5011110550511 in words is "five trillion, eleven billion, one hundred ten million, five hundred fifty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •