Base | Representation |
---|---|
bin | 1001011110010110… |
… | …11111111000100111 |
3 | 111010111011111211122 |
4 | 10233023133320213 |
5 | 40404121320011 |
6 | 2200421324155 |
7 | 240022425026 |
oct | 45713377047 |
9 | 14114144748 |
10 | 5086510631 |
11 | 21802257a4 |
12 | b9b56665b |
13 | 630a5b507 |
14 | 3637808bd |
15 | 1eb8443db |
hex | 12f2dfe27 |
5086510631 has 2 divisors, whose sum is σ = 5086510632. Its totient is φ = 5086510630.
The previous prime is 5086510613. The next prime is 5086510643. The reversal of 5086510631 is 1360156805.
Together with previous prime (5086510613) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5086510631 - 26 = 5086510567 is a prime.
It is a super-2 number, since 2×50865106312 = 51745180798552036322, which contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 5086510591 and 5086510600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5086510661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2543255315 + 2543255316.
It is an arithmetic number, because the mean of its divisors is an integer number (2543255316).
Almost surely, 25086510631 is an apocalyptic number.
5086510631 is a deficient number, since it is larger than the sum of its proper divisors (1).
5086510631 is an equidigital number, since it uses as much as digits as its factorization.
5086510631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 35.
The square root of 5086510631 is about 71319.7772781155. Note that the first 3 decimals coincide. The cubic root of 5086510631 is about 1719.7816821109.
The spelling of 5086510631 in words is "five billion, eighty-six million, five hundred ten thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •