Base | Representation |
---|---|
bin | 1001100110110001… |
… | …01000010110111101 |
3 | 111022101220220020011 |
4 | 10303120220112331 |
5 | 41030201441302 |
6 | 2211421423221 |
7 | 241540206256 |
oct | 46330502675 |
9 | 14271826204 |
10 | 5157062077 |
11 | 2207033082 |
12 | bbb10ab11 |
13 | 64256102b |
14 | 36cca7b2d |
15 | 202b2d5d7 |
hex | 1336285bd |
5157062077 has 2 divisors, whose sum is σ = 5157062078. Its totient is φ = 5157062076.
The previous prime is 5157062059. The next prime is 5157062087. The reversal of 5157062077 is 7702607515.
5157062077 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3835448761 + 1321613316 = 61931^2 + 36354^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5157062077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5157062017) 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, 2578531038 + 2578531039.
It is an arithmetic number, because the mean of its divisors is an integer number (2578531039).
Almost surely, 25157062077 is an apocalyptic number.
It is an amenable number.
5157062077 is a deficient number, since it is larger than the sum of its proper divisors (1).
5157062077 is an equidigital number, since it uses as much as digits as its factorization.
5157062077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 102900, while the sum is 40.
The square root of 5157062077 is about 71812.6874375274. The cubic root of 5157062077 is about 1727.6964984310.
The spelling of 5157062077 in words is "five billion, one hundred fifty-seven million, sixty-two thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •