Search a number
-
+
770153231 is a prime number
BaseRepresentation
bin101101111001111…
…001101100001111
31222200011211121202
4231321321230033
53034124400411
6204231020115
725041123461
oct5571715417
91880154552
10770153231
11365805581
12195b0a63b
13c3732893
14743da131
154792d83b
hex2de79b0f

770153231 has 2 divisors, whose sum is σ = 770153232. Its totient is φ = 770153230.

The previous prime is 770153213. The next prime is 770153281. The reversal of 770153231 is 132351077.

Together with previous prime (770153213) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-770153231 is a prime.

It is a super-2 number, since 2×7701532312 = 1186271998439478722, which contains 22 as substring.

It is a Sophie Germain prime.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 770153194 and 770153203.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (770153281) 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, 385076615 + 385076616.

It is an arithmetic number, because the mean of its divisors is an integer number (385076616).

Almost surely, 2770153231 is an apocalyptic number.

770153231 is a deficient number, since it is larger than the sum of its proper divisors (1).

770153231 is an equidigital number, since it uses as much as digits as its factorization.

770153231 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 4410, while the sum is 29.

The square root of 770153231 is about 27751.6347446416. The cubic root of 770153231 is about 916.6264406517.

The spelling of 770153231 in words is "seven hundred seventy million, one hundred fifty-three thousand, two hundred thirty-one".