Base | Representation |
---|---|
bin | 1001100001100100… |
… | …11110110011011001 |
3 | 111012100222001221101 |
4 | 10300302132303121 |
5 | 40433024211113 |
6 | 2203224111401 |
7 | 240501043525 |
oct | 46062366331 |
9 | 14170861841 |
10 | 5113507033 |
11 | 2194494578 |
12 | ba8605561 |
13 | 63652130b |
14 | 3671aad85 |
15 | 1eddc82dd |
hex | 130c9ecd9 |
5113507033 has 2 divisors, whose sum is σ = 5113507034. Its totient is φ = 5113507032.
The previous prime is 5113507013. The next prime is 5113507043. The reversal of 5113507033 is 3307053115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3261323664 + 1852183369 = 57108^2 + 43037^2 .
It is a cyclic number.
It is not a de Polignac number, because 5113507033 - 25 = 5113507001 is a prime.
It is a super-2 number, since 2×51135070332 = 52295908353080926178, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5113506992 and 5113507010.
It is not a weakly prime, because it can be changed into another prime (5113507013) 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, 2556753516 + 2556753517.
It is an arithmetic number, because the mean of its divisors is an integer number (2556753517).
Almost surely, 25113507033 is an apocalyptic number.
It is an amenable number.
5113507033 is a deficient number, since it is larger than the sum of its proper divisors (1).
5113507033 is an equidigital number, since it uses as much as digits as its factorization.
5113507033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4725, while the sum is 28.
The square root of 5113507033 is about 71508.7899002633. The cubic root of 5113507033 is about 1722.8188670882.
The spelling of 5113507033 in words is "five billion, one hundred thirteen million, five hundred seven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •