Base | Representation |
---|---|
bin | 1001100111001101… |
… | …00000000101111111 |
3 | 111022122202122002211 |
4 | 10303212200011333 |
5 | 41032114320424 |
6 | 2212031401251 |
7 | 241613132314 |
oct | 46346400577 |
9 | 14278678084 |
10 | 5160698239 |
11 | 2209096a74 |
12 | 1000383227 |
13 | 6432350c8 |
14 | 36d572d0b |
15 | 2030eab94 |
hex | 1339a017f |
5160698239 has 2 divisors, whose sum is σ = 5160698240. Its totient is φ = 5160698238.
The previous prime is 5160698237. The next prime is 5160698267. The reversal of 5160698239 is 9328960615.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5160698239 - 21 = 5160698237 is a prime.
It is a super-2 number, since 2×51606982392 = 53265612628035402242, which contains 22 as substring.
Together with 5160698237, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 5160698192 and 5160698201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5160698237) 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, 2580349119 + 2580349120.
It is an arithmetic number, because the mean of its divisors is an integer number (2580349120).
Almost surely, 25160698239 is an apocalyptic number.
5160698239 is a deficient number, since it is larger than the sum of its proper divisors (1).
5160698239 is an equidigital number, since it uses as much as digits as its factorization.
5160698239 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 699840, while the sum is 49.
The square root of 5160698239 is about 71837.9999651995. Note that the first 4 decimals coincide. The cubic root of 5160698239 is about 1728.1024600910.
The spelling of 5160698239 in words is "five billion, one hundred sixty million, six hundred ninety-eight thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •