Base | Representation |
---|---|
bin | 1001100000010001… |
… | …00000001010101101 |
3 | 111011121020222122210 |
4 | 10300020200022231 |
5 | 40422220040243 |
6 | 2202152201033 |
7 | 240305361540 |
oct | 46010401255 |
9 | 14147228583 |
10 | 5102502573 |
11 | 2189258783 |
12 | ba4999179 |
13 | 63416a4bc |
14 | 365944857 |
15 | 1ece52933 |
hex | 1302202ad |
5102502573 has 16 divisors (see below), whose sum is σ = 8184465920. Its totient is φ = 2762256816.
The previous prime is 5102502539. The next prime is 5102502577. The reversal of 5102502573 is 3752052015.
It is not a de Polignac number, because 5102502573 - 29 = 5102502061 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5102502573.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5102502577) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6393715 + ... + 6394512.
It is an arithmetic number, because the mean of its divisors is an integer number (511529120).
Almost surely, 25102502573 is an apocalyptic number.
It is an amenable number.
5102502573 is a deficient number, since it is larger than the sum of its proper divisors (3081963347).
5102502573 is a wasteful number, since it uses less digits than its factorization.
5102502573 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12788256.
The product of its (nonzero) digits is 10500, while the sum is 30.
The square root of 5102502573 is about 71431.8036521548. The cubic root of 5102502573 is about 1721.5821224294.
Adding to 5102502573 its reverse (3752052015), we get a palindrome (8854554588).
The spelling of 5102502573 in words is "five billion, one hundred two million, five hundred two thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •