Base | Representation |
---|---|
bin | 100100011010101011101… |
… | …0001001001000001000011 |
3 | 122201111001002120100000221 |
4 | 1020311113101021001003 |
5 | 1124000421324323021 |
6 | 14351151152523511 |
7 | 1024415032432303 |
oct | 110652721110103 |
9 | 18644032510027 |
10 | 5005101011011 |
11 | 165a719046642 |
12 | 68a032250597 |
13 | 2a3c95b2b88a |
14 | 13436901d603 |
15 | 8a2da47c241 |
hex | 48d57449043 |
5005101011011 has 2 divisors, whose sum is σ = 5005101011012. Its totient is φ = 5005101011010.
The previous prime is 5005101010969. The next prime is 5005101011017. The reversal of 5005101011011 is 1101101015005.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5005101011011 - 27 = 5005101010883 is a prime.
It is a super-2 number, since 2×50051010110112 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5005101011017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2502550505505 + 2502550505506.
It is an arithmetic number, because the mean of its divisors is an integer number (2502550505506).
Almost surely, 25005101011011 is an apocalyptic number.
5005101011011 is a deficient number, since it is larger than the sum of its proper divisors (1).
5005101011011 is an equidigital number, since it uses as much as digits as its factorization.
5005101011011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25, while the sum is 16.
Adding to 5005101011011 its reverse (1101101015005), we get a palindrome (6106202026016).
The spelling of 5005101011011 in words is "five trillion, five billion, one hundred one million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •