Base | Representation |
---|---|
bin | 1001011110010011… |
… | …11110110101100111 |
3 | 111010110102022120021 |
4 | 10233021332311213 |
5 | 40404021110002 |
6 | 2200405020011 |
7 | 240016151104 |
oct | 45711766547 |
9 | 14113368507 |
10 | 5086113127 |
11 | 217aa84087 |
12 | b9b3b4607 |
13 | 63094c5c4 |
14 | 3636b9aab |
15 | 1eb7b6737 |
hex | 12f27ed67 |
5086113127 has 2 divisors, whose sum is σ = 5086113128. Its totient is φ = 5086113126.
The previous prime is 5086113103. The next prime is 5086113161. The reversal of 5086113127 is 7213116805.
It is a happy number.
It is an a-pointer prime, because the next prime (5086113161) can be obtained adding 5086113127 to its sum of digits (34).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5086113127 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5086113092 and 5086113101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5086113167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2543056563 + 2543056564.
It is an arithmetic number, because the mean of its divisors is an integer number (2543056564).
Almost surely, 25086113127 is an apocalyptic number.
5086113127 is a deficient number, since it is larger than the sum of its proper divisors (1).
5086113127 is an equidigital number, since it uses as much as digits as its factorization.
5086113127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10080, while the sum is 34.
The square root of 5086113127 is about 71316.9904510840. The cubic root of 5086113127 is about 1719.7368813981.
The spelling of 5086113127 in words is "five billion, eighty-six million, one hundred thirteen thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •