Base | Representation |
---|---|
bin | 1001100001001110… |
… | …10000011100000101 |
3 | 111012011102120200212 |
4 | 10300213100130011 |
5 | 40431301031423 |
6 | 2203041045205 |
7 | 240434040200 |
oct | 46047203405 |
9 | 14164376625 |
10 | 5110564613 |
11 | 2192864920 |
12 | ba7626805 |
13 | 635a30c3b |
14 | 366a42937 |
15 | 1ed9e6578 |
hex | 1309d0705 |
5110564613 has 24 divisors (see below), whose sum is σ = 6694619904. Its totient is φ = 3853785600.
The previous prime is 5110564607. The next prime is 5110564639. The reversal of 5110564613 is 3164650115.
It is not a de Polignac number, because 5110564613 - 220 = 5109516037 is a prime.
It is a super-2 number, since 2×51105646132 = 52235741327295679538, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5110564613.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5110564673) 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 in 23 ways as a sum of consecutive naturals, for example, 136220 + ... + 169637.
It is an arithmetic number, because the mean of its divisors is an integer number (278942496).
Almost surely, 25110564613 is an apocalyptic number.
It is an amenable number.
5110564613 is a deficient number, since it is larger than the sum of its proper divisors (1584055291).
5110564613 is a wasteful number, since it uses less digits than its factorization.
5110564613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305913 (or 305906 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 32.
The square root of 5110564613 is about 71488.2131053784. The cubic root of 5110564613 is about 1722.4883548919.
The spelling of 5110564613 in words is "five billion, one hundred ten million, five hundred sixty-four thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •