Search a number
-
+
827288981 is a prime number
BaseRepresentation
bin110001010011110…
…110110110010101
32010122200122010122
4301103312312111
53143241221411
6214031401325
726333561141
oct6123666625
92118618118
10827288981
11394a8a502
121b1083245
13102518c0c
147bc30221
154c9679db
hex314f6d95

827288981 has 2 divisors, whose sum is σ = 827288982. Its totient is φ = 827288980.

The previous prime is 827288927. The next prime is 827288983. The reversal of 827288981 is 189882728.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 819676900 + 7612081 = 28630^2 + 2759^2 .

It is a cyclic number.

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

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

It is a Sophie Germain prime.

Together with 827288983, it forms a pair of twin primes.

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 (827288983) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2827288981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1032192, while the sum is 53.

The square root of 827288981 is about 28762.6316772301. The cubic root of 827288981 is about 938.7553244816.

The spelling of 827288981 in words is "eight hundred twenty-seven million, two hundred eighty-eight thousand, nine hundred eighty-one".