Search a number
-
+
31169057 is a prime number
BaseRepresentation
bin111011011100…
…1101000100001
32011122112220112
41312321220201
530434402212
63032021105
7525634613
oct166715041
964575815
1031169057
1116659857
12a531795
1365c413a
1441d4db3
152b0a422
hex1db9a21

31169057 has 2 divisors, whose sum is σ = 31169058. Its totient is φ = 31169056.

The previous prime is 31169027. The next prime is 31169069. The reversal of 31169057 is 75096113.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 30514576 + 654481 = 5524^2 + 809^2 .

It is a cyclic number.

It is not a de Polignac number, because 31169057 - 218 = 30906913 is a prime.

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

It is a Chen prime.

It is equal to p1925717 and since 31169057 and 1925717 have the same sum of digits, it is a Honaker prime.

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

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

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

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

Almost surely, 231169057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5670, while the sum is 32.

The square root of 31169057 is about 5582.9254875916. The cubic root of 31169057 is about 314.7080758958.

The spelling of 31169057 in words is "thirty-one million, one hundred sixty-nine thousand, fifty-seven".