Search a number
-
+
311168933 is a prime number
BaseRepresentation
bin10010100011000…
…000111110100101
3210200112000112022
4102203000332211
51114124401213
650513232525
710465615025
oct2243007645
9720460468
10311168933
1114a712909
1288262745
134c60b73a
142d47da85
151c4b8308
hex128c0fa5

311168933 has 2 divisors, whose sum is σ = 311168934. Its totient is φ = 311168932.

The previous prime is 311168911. The next prime is 311168951. The reversal of 311168933 is 339861113.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 287031364 + 24137569 = 16942^2 + 4913^2 .

It is a cyclic number.

It is not a de Polignac number, because 311168933 - 28 = 311168677 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

Almost surely, 2311168933 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 11664, while the sum is 35.

The square root of 311168933 is about 17639.9810940942. The cubic root of 311168933 is about 677.6395471504.

The spelling of 311168933 in words is "three hundred eleven million, one hundred sixty-eight thousand, nine hundred thirty-three".