Base | Representation |
---|---|
bin | 101101101010100… |
… | …011100000111101 |
3 | 1222101121110002222 |
4 | 231222203200331 |
5 | 3032112131422 |
6 | 204004455125 |
7 | 24661666565 |
oct | 5552434075 |
9 | 1871543088 |
10 | 766130237 |
11 | 363507a94 |
12 | 1946aa4a5 |
13 | c2954702 |
14 | 73a6dda5 |
15 | 473d6842 |
hex | 2daa383d |
766130237 has 2 divisors, whose sum is σ = 766130238. Its totient is φ = 766130236.
The previous prime is 766130231. The next prime is 766130273. The reversal of 766130237 is 732031667.
It is a happy number.
Together with next prime (766130273) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 559748281 + 206381956 = 23659^2 + 14366^2 .
It is an emirp because it is prime and its reverse (732031667) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 766130237 - 210 = 766129213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 766130197 and 766130206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (766130231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 383065118 + 383065119.
It is an arithmetic number, because the mean of its divisors is an integer number (383065119).
Almost surely, 2766130237 is an apocalyptic number.
It is an amenable number.
766130237 is a deficient number, since it is larger than the sum of its proper divisors (1).
766130237 is an equidigital number, since it uses as much as digits as its factorization.
766130237 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 31752, while the sum is 35.
The square root of 766130237 is about 27679.0577332394. The cubic root of 766130237 is about 915.0276150006.
The spelling of 766130237 in words is "seven hundred sixty-six million, one hundred thirty thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •