Base | Representation |
---|---|
bin | 1001101100100110… |
… | …11011111000101101 |
3 | 111102211001211012221 |
4 | 10312103123320231 |
5 | 41130221010132 |
6 | 2220331155341 |
7 | 243003353422 |
oct | 46623337055 |
9 | 14384054187 |
10 | 5206031917 |
11 | 223173a919 |
12 | 10135a5b51 |
13 | 64c748578 |
14 | 3755b3d49 |
15 | 2070a2e97 |
hex | 1364dbe2d |
5206031917 has 2 divisors, whose sum is σ = 5206031918. Its totient is φ = 5206031916.
The previous prime is 5206031881. The next prime is 5206031951. The reversal of 5206031917 is 7191306025.
It is an a-pointer prime, because the next prime (5206031951) can be obtained adding 5206031917 to its sum of digits (34).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5123839561 + 82192356 = 71581^2 + 9066^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5206031917 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5206034917) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2603015958 + 2603015959.
It is an arithmetic number, because the mean of its divisors is an integer number (2603015959).
Almost surely, 25206031917 is an apocalyptic number.
It is an amenable number.
5206031917 is a deficient number, since it is larger than the sum of its proper divisors (1).
5206031917 is an equidigital number, since it uses as much as digits as its factorization.
5206031917 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11340, while the sum is 34.
The square root of 5206031917 is about 72152.8372068625. The cubic root of 5206031917 is about 1733.1478341881.
The spelling of 5206031917 in words is "five billion, two hundred six million, thirty-one thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •