Search a number
-
+
808112069 is a prime number
BaseRepresentation
bin110000001010101…
…100111111000101
32002022121100100122
4300022230333011
53123334041234
6212104351325
726011560602
oct6012547705
92068540318
10808112069
11385181616
121a6775545
13cb56332b
147947b6a9
154ae2a92e
hex302acfc5

808112069 has 2 divisors, whose sum is σ = 808112070. Its totient is φ = 808112068.

The previous prime is 808112059. The next prime is 808112087. The reversal of 808112069 is 960211808.

808112069 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 522671044 + 285441025 = 22862^2 + 16895^2 .

It is a cyclic number.

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

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

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (808112059) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 404056034 + 404056035.

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

Almost surely, 2808112069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6912, while the sum is 35.

The square root of 808112069 is about 28427.3120255855. The cubic root of 808112069 is about 931.4449611541. Note that the first 3 decimals are identical.

The spelling of 808112069 in words is "eight hundred eight million, one hundred twelve thousand, sixty-nine".