Base | Representation |
---|---|
bin | 1001011001000101… |
… | …11010000100101101 |
3 | 111000102000011121100 |
4 | 10230202322010231 |
5 | 40311313044230 |
6 | 2152202153313 |
7 | 235644655320 |
oct | 45442720455 |
9 | 14012004540 |
10 | 5042315565 |
11 | 215828a351 |
12 | b887b2839 |
13 | 6248563a1 |
14 | 35b9587b7 |
15 | 1e7a14660 |
hex | 12c8ba12d |
5042315565 has 48 divisors (see below), whose sum is σ = 9999789696. Its totient is φ = 2302473600.
The previous prime is 5042315561. The next prime is 5042315569. The reversal of 5042315565 is 5655132405.
5042315565 is a `hidden beast` number, since 50 + 42 + 3 + 1 + 5 + 565 = 666.
It is an interprime number because it is at equal distance from previous prime (5042315561) and next prime (5042315569).
It is not a de Polignac number, because 5042315565 - 22 = 5042315561 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5042315561) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 287910 + ... + 304920.
It is an arithmetic number, because the mean of its divisors is an integer number (208328952).
Almost surely, 25042315565 is an apocalyptic number.
It is an amenable number.
5042315565 is a deficient number, since it is larger than the sum of its proper divisors (4957474131).
5042315565 is a wasteful number, since it uses less digits than its factorization.
5042315565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17970 (or 17967 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 36.
The square root of 5042315565 is about 71009.2639378835. The cubic root of 5042315565 is about 1714.7863084336.
It can be divided in two parts, 504231 and 5565, that added together give a square (509796 = 7142).
The spelling of 5042315565 in words is "five billion, forty-two million, three hundred fifteen thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •