Base | Representation |
---|---|
bin | 100100011101011110101… |
… | …1101100001101010010011 |
3 | 122202001112220111001112122 |
4 | 1020322331131201222103 |
5 | 1124100223242013021 |
6 | 14354023345044455 |
7 | 1025016663314306 |
oct | 110727535415223 |
9 | 18661486431478 |
10 | 5011110501011 |
11 | 16622222693aa |
12 | 68b22a92672b |
13 | 2a4712b6b014 |
14 | 1347791bcb3d |
15 | 8a53cd3bbab |
hex | 48ebd761a93 |
5011110501011 has 8 divisors (see below), whose sum is σ = 5081846169600. Its totient is φ = 4940379183880.
The previous prime is 5011110500953. The next prime is 5011110501083. The reversal of 5011110501011 is 1101050111105.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5011110501011 - 234 = 4993930631827 is a prime.
It is a super-2 number, since 2×50111105010112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5011110501611) 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 7 ways as a sum of consecutive naturals, for example, 1267310 + ... + 3410028.
It is an arithmetic number, because the mean of its divisors is an integer number (635230771200).
Almost surely, 25011110501011 is an apocalyptic number.
5011110501011 is a deficient number, since it is larger than the sum of its proper divisors (70735668589).
5011110501011 is a wasteful number, since it uses less digits than its factorization.
5011110501011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2175729.
The product of its (nonzero) digits is 25, while the sum is 17.
Adding to 5011110501011 its reverse (1101050111105), we get a palindrome (6112160612116).
The spelling of 5011110501011 in words is "five trillion, eleven billion, one hundred ten million, five hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •