Base | Representation |
---|---|
bin | 1001011010001101… |
… | …00011011100100001 |
3 | 111001001120220211221 |
4 | 10231012203130201 |
5 | 40321211110230 |
6 | 2153134335041 |
7 | 236120254624 |
oct | 45506433441 |
9 | 14031526757 |
10 | 5051660065 |
11 | 2162591a81 |
12 | b8b95a481 |
13 | 62677878a |
14 | 35ccabdbb |
15 | 1e875d27a |
hex | 12d1a3721 |
5051660065 has 4 divisors (see below), whose sum is σ = 6061992084. Its totient is φ = 4041328048.
The previous prime is 5051660051. The next prime is 5051660069. The reversal of 5051660065 is 5600661505.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2375977536 + 2675682529 = 48744^2 + 51727^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5051660065 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 5051660065.
It is not an unprimeable number, because it can be changed into a prime (5051660069) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 505166002 + ... + 505166011.
It is an arithmetic number, because the mean of its divisors is an integer number (1515498021).
Almost surely, 25051660065 is an apocalyptic number.
It is an amenable number.
5051660065 is a deficient number, since it is larger than the sum of its proper divisors (1010332019).
5051660065 is a wasteful number, since it uses less digits than its factorization.
5051660065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1010332018.
The product of its (nonzero) digits is 27000, while the sum is 34.
The square root of 5051660065 is about 71075.0312346045. The cubic root of 5051660065 is about 1715.8449445634.
The spelling of 5051660065 in words is "five billion, fifty-one million, six hundred sixty thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •