Base | Representation |
---|---|
bin | 1001100001001110… |
… | …11001000101111001 |
3 | 111012011111101022121 |
4 | 10300213121011321 |
5 | 40431303200212 |
6 | 2203041521241 |
7 | 240434245423 |
oct | 46047310571 |
9 | 14164441277 |
10 | 5110600057 |
11 | 2192889512 |
12 | ba7643221 |
13 | 635a44104 |
14 | 366a51813 |
15 | 1eda01d07 |
hex | 1309d9179 |
5110600057 has 2 divisors, whose sum is σ = 5110600058. Its totient is φ = 5110600056.
The previous prime is 5110600043. The next prime is 5110600063. The reversal of 5110600057 is 7500060115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2944256121 + 2166343936 = 54261^2 + 46544^2 .
It is a cyclic number.
It is not a de Polignac number, because 5110600057 - 27 = 5110599929 is a prime.
It is a super-2 number, since 2×51106000572 = 52236465885216806498, which contains 22 as substring.
It is a nialpdrome in base 12.
It is not a weakly prime, because it can be changed into another prime (5110600007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2555300028 + 2555300029.
It is an arithmetic number, because the mean of its divisors is an integer number (2555300029).
Almost surely, 25110600057 is an apocalyptic number.
It is an amenable number.
5110600057 is a deficient number, since it is larger than the sum of its proper divisors (1).
5110600057 is an equidigital number, since it uses as much as digits as its factorization.
5110600057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1050, while the sum is 25.
The square root of 5110600057 is about 71488.4610059554. The cubic root of 5110600057 is about 1722.4923369526.
The spelling of 5110600057 in words is "five billion, one hundred ten million, six hundred thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •