Base | Representation |
---|---|
bin | 1001100001111110… |
… | …00001101110100101 |
3 | 111012121011011022001 |
4 | 10300333001232211 |
5 | 40434344431223 |
6 | 2203422405301 |
7 | 240541022023 |
oct | 46077015645 |
9 | 14177134261 |
10 | 5116795813 |
11 | 2196330478 |
12 | ba9730831 |
13 | 63710323c |
14 | 3677c5713 |
15 | 1ee3279ad |
hex | 130fc1ba5 |
5116795813 has 4 divisors (see below), whose sum is σ = 5417783820. Its totient is φ = 4815807808.
The previous prime is 5116795807. The next prime is 5116795843. The reversal of 5116795813 is 3185976115.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3735409924 + 1381385889 = 61118^2 + 37167^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5116795813 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5116795843) 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 in 3 ways as a sum of consecutive naturals, for example, 150493978 + ... + 150494011.
It is an arithmetic number, because the mean of its divisors is an integer number (1354445955).
Almost surely, 25116795813 is an apocalyptic number.
It is an amenable number.
5116795813 is a deficient number, since it is larger than the sum of its proper divisors (300988007).
5116795813 is a wasteful number, since it uses less digits than its factorization.
5116795813 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300988006.
The product of its digits is 226800, while the sum is 46.
The square root of 5116795813 is about 71531.7818385646. The cubic root of 5116795813 is about 1723.1881347246.
The spelling of 5116795813 in words is "five billion, one hundred sixteen million, seven hundred ninety-five thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •