Base | Representation |
---|---|
bin | 1001100010001000… |
… | …11101011100000001 |
3 | 111012200211111221221 |
4 | 10301010131130001 |
5 | 40440231020113 |
6 | 2203513115041 |
7 | 240556103203 |
oct | 46104353401 |
9 | 14180744857 |
10 | 5118220033 |
11 | 2197113513 |
12 | baa0b8a81 |
13 | 6374b1584 |
14 | 367a76773 |
15 | 1ee50998d |
hex | 13111d701 |
5118220033 has 2 divisors, whose sum is σ = 5118220034. Its totient is φ = 5118220032.
The previous prime is 5118220013. The next prime is 5118220157. The reversal of 5118220033 is 3300228115.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5116111729 + 2108304 = 71527^2 + 1452^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5118220033 is a prime.
It is a super-3 number, since 3×51182200333 (a number of 30 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (5118220013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2559110016 + 2559110017.
It is an arithmetic number, because the mean of its divisors is an integer number (2559110017).
Almost surely, 25118220033 is an apocalyptic number.
It is an amenable number.
5118220033 is a deficient number, since it is larger than the sum of its proper divisors (1).
5118220033 is an equidigital number, since it uses as much as digits as its factorization.
5118220033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 5118220033 is about 71541.7363012668. The cubic root of 5118220033 is about 1723.3479985292.
Adding to 5118220033 its reverse (3300228115), we get a palindrome (8418448148).
The spelling of 5118220033 in words is "five billion, one hundred eighteen million, two hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •