Base | Representation |
---|---|
bin | 1001100010011011… |
… | …10010100001110101 |
3 | 111012212102202210211 |
4 | 10301031302201311 |
5 | 40441342300332 |
6 | 2204041345421 |
7 | 240615640366 |
oct | 46115624165 |
9 | 14185382724 |
10 | 5120665717 |
11 | 2198533a42 |
12 | baaa98271 |
13 | 637b5981b |
14 | 368111b6d |
15 | 1ee83e447 |
hex | 131372875 |
5120665717 has 2 divisors, whose sum is σ = 5120665718. Its totient is φ = 5120665716.
The previous prime is 5120665609. The next prime is 5120665729. The reversal of 5120665717 is 7175660215.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2792699716 + 2327966001 = 52846^2 + 48249^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5120665717 is a prime.
It is a super-3 number, since 3×51206657173 (a number of 30 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5120665717.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5120665747) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2560332858 + 2560332859.
It is an arithmetic number, because the mean of its divisors is an integer number (2560332859).
Almost surely, 25120665717 is an apocalyptic number.
It is an amenable number.
5120665717 is a deficient number, since it is larger than the sum of its proper divisors (1).
5120665717 is an equidigital number, since it uses as much as digits as its factorization.
5120665717 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 88200, while the sum is 40.
The square root of 5120665717 is about 71558.8269677473. The cubic root of 5120665717 is about 1723.6224489860.
The spelling of 5120665717 in words is "five billion, one hundred twenty million, six hundred sixty-five thousand, seven hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •