Base | Representation |
---|---|
bin | 1001100011101010… |
… | …00001010000010011 |
3 | 111020120210020201021 |
4 | 10301311001100103 |
5 | 41002010342101 |
6 | 2205050020311 |
7 | 241102231612 |
oct | 46165012023 |
9 | 14216706637 |
10 | 5130949651 |
11 | 21a3318463 |
12 | bb2417697 |
13 | 63a01a6a9 |
14 | 36962b879 |
15 | 2006c15a1 |
hex | 131d41413 |
5130949651 has 2 divisors, whose sum is σ = 5130949652. Its totient is φ = 5130949650.
The previous prime is 5130949561. The next prime is 5130949661. The reversal of 5130949651 is 1569490315.
Together with previous prime (5130949561) 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 5130949651 - 29 = 5130949139 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5130949598 and 5130949607.
It is not a weakly prime, because it can be changed into another prime (5130949661) 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, 2565474825 + 2565474826.
It is an arithmetic number, because the mean of its divisors is an integer number (2565474826).
Almost surely, 25130949651 is an apocalyptic number.
5130949651 is a deficient number, since it is larger than the sum of its proper divisors (1).
5130949651 is an equidigital number, since it uses as much as digits as its factorization.
5130949651 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145800, while the sum is 43.
The square root of 5130949651 is about 71630.6474283180. The cubic root of 5130949651 is about 1724.7755390639.
The spelling of 5130949651 in words is "five billion, one hundred thirty million, nine hundred forty-nine thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •