Base | Representation |
---|---|
bin | 1001011010110010… |
… | …11001101010001101 |
3 | 111001101212221011001 |
4 | 10231121121222031 |
5 | 40323442210332 |
6 | 2153432300301 |
7 | 236210253100 |
oct | 45531315215 |
9 | 14041787131 |
10 | 5056600717 |
11 | 2165356a63 |
12 | b91541691 |
13 | 6277b853c |
14 | 35d7d6737 |
15 | 1e8dd70e7 |
hex | 12d659a8d |
5056600717 has 24 divisors (see below), whose sum is σ = 6255148536. Its totient is φ = 4061611008.
The previous prime is 5056600711. The next prime is 5056600721. The reversal of 5056600717 is 7170066505.
It can be written as a sum of positive squares in 4 ways, for example, as 1464516361 + 3592084356 = 38269^2 + 59934^2 .
It is not a de Polignac number, because 5056600717 - 215 = 5056567949 is a prime.
It is a super-2 number, since 2×50566007172 = 51138421622329828178, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5056600711) 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 23 ways as a sum of consecutive naturals, for example, 181063 + ... + 207115.
It is an arithmetic number, because the mean of its divisors is an integer number (260631189).
Almost surely, 25056600717 is an apocalyptic number.
It is an amenable number.
5056600717 is a deficient number, since it is larger than the sum of its proper divisors (1198547819).
5056600717 is a wasteful number, since it uses less digits than its factorization.
5056600717 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26317 (or 26310 counting only the distinct ones).
The product of its (nonzero) digits is 44100, while the sum is 37.
The square root of 5056600717 is about 71109.7793344910. The cubic root of 5056600717 is about 1716.4041422955.
The spelling of 5056600717 in words is "five billion, fifty-six million, six hundred thousand, seven hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •