Base | Representation |
---|---|
bin | 1001101100010111… |
… | …01101000110001101 |
3 | 111102200020212011121 |
4 | 10312023231012031 |
5 | 41124211132021 |
6 | 2220215520541 |
7 | 242650213000 |
oct | 46613550615 |
9 | 14380225147 |
10 | 5204005261 |
11 | 22305861a4 |
12 | 1012989151 |
13 | 64c1b8c70 |
14 | 375207537 |
15 | 206d02741 |
hex | 1362ed18d |
5204005261 has 64 divisors (see below), whose sum is σ = 6741504000. Its totient is φ = 3990168000.
The previous prime is 5204005249. The next prime is 5204005273. The reversal of 5204005261 is 1625004025.
It is an interprime number because it is at equal distance from previous prime (5204005249) and next prime (5204005273).
It is not a de Polignac number, because 5204005261 - 213 = 5203997069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5204005661) 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 63 ways as a sum of consecutive naturals, for example, 34463536 + ... + 34463686.
It is an arithmetic number, because the mean of its divisors is an integer number (105336000).
Almost surely, 25204005261 is an apocalyptic number.
It is an amenable number.
5204005261 is a deficient number, since it is larger than the sum of its proper divisors (1537498739).
5204005261 is a wasteful number, since it uses less digits than its factorization.
5204005261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 375 (or 361 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 5204005261 is about 72138.7916519261. The cubic root of 5204005261 is about 1732.9229059763.
Adding to 5204005261 its reverse (1625004025), we get a palindrome (6829009286).
The spelling of 5204005261 in words is "five billion, two hundred four million, five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •