Base | Representation |
---|---|
bin | 1001101000101010… |
… | …11101111000001011 |
3 | 111100111221010120102 |
4 | 10310111131320023 |
5 | 41043242304211 |
6 | 2213151320015 |
7 | 242122600415 |
oct | 46425357013 |
9 | 14314833512 |
10 | 5173009931 |
11 | 2215035a21 |
12 | 100452000b |
13 | 645955c2b |
14 | 3710599b5 |
15 | 20422da3b |
hex | 13455de0b |
5173009931 has 2 divisors, whose sum is σ = 5173009932. Its totient is φ = 5173009930.
The previous prime is 5173009913. The next prime is 5173009969. The reversal of 5173009931 is 1399003715.
Together with previous prime (5173009913) it forms an Ormiston pair, because they use the same digits, order apart.
It is an a-pointer prime, because the next prime (5173009969) can be obtained adding 5173009931 to its sum of digits (38).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5173009931 - 26 = 5173009867 is a prime.
It is a super-2 number, since 2×51730099312 = 53520063492449249522, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5173009031) 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, 2586504965 + 2586504966.
It is an arithmetic number, because the mean of its divisors is an integer number (2586504966).
Almost surely, 25173009931 is an apocalyptic number.
5173009931 is a deficient number, since it is larger than the sum of its proper divisors (1).
5173009931 is an equidigital number, since it uses as much as digits as its factorization.
5173009931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25515, while the sum is 38.
The square root of 5173009931 is about 71923.6395839365. The cubic root of 5173009931 is about 1729.4755926669.
The spelling of 5173009931 in words is "five billion, one hundred seventy-three million, nine thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •