Base | Representation |
---|---|
bin | 101101101010001… |
… | …111111101011001 |
3 | 1222101110101020022 |
4 | 231222033331121 |
5 | 3032102101022 |
6 | 204003040225 |
7 | 24661214216 |
oct | 5552177531 |
9 | 1871411208 |
10 | 766050137 |
11 | 363462896 |
12 | 194670075 |
13 | c2927108 |
14 | 73a4cb0d |
15 | 473bcc42 |
hex | 2da8ff59 |
766050137 has 2 divisors, whose sum is σ = 766050138. Its totient is φ = 766050136.
The previous prime is 766050127. The next prime is 766050143. The reversal of 766050137 is 731050667.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 397563721 + 368486416 = 19939^2 + 19196^2 .
It is a cyclic number.
It is not a de Polignac number, because 766050137 - 210 = 766049113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 766050097 and 766050106.
It is not a weakly prime, because it can be changed into another prime (766050127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 383025068 + 383025069.
It is an arithmetic number, because the mean of its divisors is an integer number (383025069).
Almost surely, 2766050137 is an apocalyptic number.
It is an amenable number.
766050137 is a deficient number, since it is larger than the sum of its proper divisors (1).
766050137 is an equidigital number, since it uses as much as digits as its factorization.
766050137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26460, while the sum is 35.
The square root of 766050137 is about 27677.6107530979. The cubic root of 766050137 is about 914.9957247454.
The spelling of 766050137 in words is "seven hundred sixty-six million, fifty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •