Base | Representation |
---|---|
bin | 101101111101000… |
… | …110001000011001 |
3 | 1222201202101022001 |
4 | 231331012020121 |
5 | 3034333144432 |
6 | 204301001001 |
7 | 25051212025 |
oct | 5575061031 |
9 | 1881671261 |
10 | 770990617 |
11 | 366227731 |
12 | 196253161 |
13 | c3966a87 |
14 | 74577385 |
15 | 47a469e7 |
hex | 2df46219 |
770990617 has 2 divisors, whose sum is σ = 770990618. Its totient is φ = 770990616.
The previous prime is 770990603. The next prime is 770990663. The reversal of 770990617 is 716099077.
770990617 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (770990663) can be obtained adding 770990617 to its sum of digits (46).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 531948096 + 239042521 = 23064^2 + 15461^2 .
It is an emirp because it is prime and its reverse (716099077) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 770990617 - 215 = 770957849 is a prime.
It is not a weakly prime, because it can be changed into another prime (770994617) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 385495308 + 385495309.
It is an arithmetic number, because the mean of its divisors is an integer number (385495309).
Almost surely, 2770990617 is an apocalyptic number.
It is an amenable number.
770990617 is a deficient number, since it is larger than the sum of its proper divisors (1).
770990617 is an equidigital number, since it uses as much as digits as its factorization.
770990617 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 166698, while the sum is 46.
The square root of 770990617 is about 27766.7177930702. The cubic root of 770990617 is about 916.9585356570.
The spelling of 770990617 in words is "seven hundred seventy million, nine hundred ninety thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •