Base | Representation |
---|---|
bin | 1001011011110011… |
… | …01010000100000101 |
3 | 111001222210112022211 |
4 | 10231321222010011 |
5 | 40333123302032 |
6 | 2154333423421 |
7 | 236342161423 |
oct | 45571520405 |
9 | 14058715284 |
10 | 5065056517 |
11 | 216a101a24 |
12 | b9433ab71 |
13 | 629489281 |
14 | 360998113 |
15 | 1e9a07747 |
hex | 12de6a105 |
5065056517 has 8 divisors (see below), whose sum is σ = 5410463256. Its totient is φ = 4724923392.
The previous prime is 5065056511. The next prime is 5065056541. The reversal of 5065056517 is 7156505605.
It can be written as a sum of positive squares in 4 ways, for example, as 624300196 + 4440756321 = 24986^2 + 66639^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5065056517 - 211 = 5065054469 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 5065056517.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5065056511) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1316418 + ... + 1320259.
It is an arithmetic number, because the mean of its divisors is an integer number (676307907).
Almost surely, 25065056517 is an apocalyptic number.
It is an amenable number.
5065056517 is a deficient number, since it is larger than the sum of its proper divisors (345406739).
5065056517 is a wasteful number, since it uses less digits than its factorization.
5065056517 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2636807.
The product of its (nonzero) digits is 157500, while the sum is 40.
The square root of 5065056517 is about 71169.2104564888. The cubic root of 5065056517 is about 1717.3603503923.
The spelling of 5065056517 in words is "five billion, sixty-five million, fifty-six thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •