Base | Representation |
---|---|
bin | 1001011010110110… |
… | …10111000110000101 |
3 | 111001102212000221002 |
4 | 10231123113012011 |
5 | 40324110131001 |
6 | 2153451303045 |
7 | 236214523025 |
oct | 45533270605 |
9 | 14042760832 |
10 | 5057114501 |
11 | 2165677a7a |
12 | b9174aa85 |
13 | 62793835a |
14 | 35d8cba85 |
15 | 1e8e8946b |
hex | 12d6d7185 |
5057114501 has 2 divisors, whose sum is σ = 5057114502. Its totient is φ = 5057114500.
The previous prime is 5057114483. The next prime is 5057114519. The reversal of 5057114501 is 1054117505.
It is a balanced prime because it is at equal distance from previous prime (5057114483) and next prime (5057114519).
It can be written as a sum of positive squares in only one way, i.e., 3818004100 + 1239110401 = 61790^2 + 35201^2 .
It is a cyclic number.
It is not a de Polignac number, because 5057114501 - 226 = 4990005637 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5057114551) 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, 2528557250 + 2528557251.
It is an arithmetic number, because the mean of its divisors is an integer number (2528557251).
Almost surely, 25057114501 is an apocalyptic number.
It is an amenable number.
5057114501 is a deficient number, since it is larger than the sum of its proper divisors (1).
5057114501 is an equidigital number, since it uses as much as digits as its factorization.
5057114501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3500, while the sum is 29.
The square root of 5057114501 is about 71113.3918541367. The cubic root of 5057114501 is about 1716.4622729891.
The spelling of 5057114501 in words is "five billion, fifty-seven million, one hundred fourteen thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •