Base | Representation |
---|---|
bin | 101101110010110… |
… | …111000100111001 |
3 | 1222112201001202211 |
4 | 231302313010321 |
5 | 3033141320023 |
6 | 204123255121 |
7 | 25016335411 |
oct | 5562670471 |
9 | 1875631684 |
10 | 768307513 |
11 | 364764896 |
12 | 19537a4a1 |
13 | c323773c |
14 | 74079641 |
15 | 476b6a0d |
hex | 2dcb7139 |
768307513 has 2 divisors, whose sum is σ = 768307514. Its totient is φ = 768307512.
The previous prime is 768307489. The next prime is 768307517. The reversal of 768307513 is 315703867.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 665020944 + 103286569 = 25788^2 + 10163^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-768307513 is a prime.
It is equal to p39598033 and since 768307513 and 39598033 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (768307517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 384153756 + 384153757.
It is an arithmetic number, because the mean of its divisors is an integer number (384153757).
Almost surely, 2768307513 is an apocalyptic number.
It is an amenable number.
768307513 is a deficient number, since it is larger than the sum of its proper divisors (1).
768307513 is an equidigital number, since it uses as much as digits as its factorization.
768307513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 105840, while the sum is 40.
The square root of 768307513 is about 27718.3605756185. The cubic root of 768307513 is about 915.8936049934.
The spelling of 768307513 in words is "seven hundred sixty-eight million, three hundred seven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.038 sec. • engine limits •