Base | Representation |
---|---|
bin | 1001101011111010… |
… | …00100100000111011 |
3 | 111102102000221211120 |
4 | 10311331010200323 |
5 | 41122220402034 |
6 | 2220001400323 |
7 | 242602464423 |
oct | 46575044073 |
9 | 14372027746 |
10 | 5200169019 |
11 | 22293a5a51 |
12 | 10116390a3 |
13 | 64b474ab6 |
14 | 3748c9483 |
15 | 2067e5c49 |
hex | 135f4483b |
5200169019 has 4 divisors (see below), whose sum is σ = 6933558696. Its totient is φ = 3466779344.
The previous prime is 5200169011. The next prime is 5200169027. The reversal of 5200169019 is 9109610025.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (5200169011) and next prime (5200169027).
It is a cyclic number.
It is not a de Polignac number, because 5200169019 - 23 = 5200169011 is a prime.
It is a super-2 number, since 2×52001690192 = 54083515652334844722, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5200169011) 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, 866694834 + ... + 866694839.
It is an arithmetic number, because the mean of its divisors is an integer number (1733389674).
Almost surely, 25200169019 is an apocalyptic number.
5200169019 is a deficient number, since it is larger than the sum of its proper divisors (1733389677).
5200169019 is a wasteful number, since it uses less digits than its factorization.
5200169019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1733389676.
The product of its (nonzero) digits is 4860, while the sum is 33.
The square root of 5200169019 is about 72112.1974356627. The cubic root of 5200169019 is about 1732.4969811025.
The spelling of 5200169019 in words is "five billion, two hundred million, one hundred sixty-nine thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •