Base | Representation |
---|---|
bin | 1001100100101010… |
… | …01100001100010001 |
3 | 111021011122201011122 |
4 | 10302111030030101 |
5 | 41011140224212 |
6 | 2205550452025 |
7 | 241234015034 |
oct | 46225141421 |
9 | 14234581148 |
10 | 5139383057 |
11 | 21a8058616 |
12 | bb5204015 |
13 | 63b9b1183 |
14 | 36a7c501b |
15 | 2012da272 |
hex | 13254c311 |
5139383057 has 2 divisors, whose sum is σ = 5139383058. Its totient is φ = 5139383056.
The previous prime is 5139383021. The next prime is 5139383059. The reversal of 5139383057 is 7503839315.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3719902081 + 1419480976 = 60991^2 + 37676^2 .
It is a cyclic number.
It is not a de Polignac number, because 5139383057 - 26 = 5139382993 is a prime.
Together with 5139383059, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 5139382999 and 5139383017.
It is not a weakly prime, because it can be changed into another prime (5139383059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2569691528 + 2569691529.
It is an arithmetic number, because the mean of its divisors is an integer number (2569691529).
Almost surely, 25139383057 is an apocalyptic number.
It is an amenable number.
5139383057 is a deficient number, since it is larger than the sum of its proper divisors (1).
5139383057 is an equidigital number, since it uses as much as digits as its factorization.
5139383057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 340200, while the sum is 44.
The square root of 5139383057 is about 71689.4905617274. The cubic root of 5139383057 is about 1725.7199886849.
The spelling of 5139383057 in words is "five billion, one hundred thirty-nine million, three hundred eighty-three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •