Base | Representation |
---|---|
bin | 1001010101100110… |
… | …10111101000011111 |
3 | 110221100222200011102 |
4 | 10222303113220133 |
5 | 40231321422021 |
6 | 2145235343315 |
7 | 235141306262 |
oct | 45263275037 |
9 | 13840880142 |
10 | 5013076511 |
11 | 2142829643 |
12 | b7aa51b3b |
13 | 61b789881 |
14 | 357b06cd9 |
15 | 1e518b00b |
hex | 12acd7a1f |
5013076511 has 2 divisors, whose sum is σ = 5013076512. Its totient is φ = 5013076510.
The previous prime is 5013076493. The next prime is 5013076543. The reversal of 5013076511 is 1156703105.
5013076511 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5013076511 - 226 = 4945967647 is a prime.
It is a super-2 number, since 2×50130765112 = 50261872210279866242, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5013076571) 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 as a sum of consecutive naturals, namely, 2506538255 + 2506538256.
It is an arithmetic number, because the mean of its divisors is an integer number (2506538256).
Almost surely, 25013076511 is an apocalyptic number.
5013076511 is a deficient number, since it is larger than the sum of its proper divisors (1).
5013076511 is an equidigital number, since it uses as much as digits as its factorization.
5013076511 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3150, while the sum is 29.
The square root of 5013076511 is about 70803.0826376931. The cubic root of 5013076511 is about 1711.4653503019.
Adding to 5013076511 its reverse (1156703105), we get a palindrome (6169779616).
The spelling of 5013076511 in words is "five billion, thirteen million, seventy-six thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •