Search a number
-
+
5695239731 is a prime number
BaseRepresentation
bin1010100110111011…
…00111011000110011
3112200220121011011212
411103131213120303
543130440132411
62341044430335
7261063511316
oct52335473063
915626534155
105695239731
1124628a59a5
12112b3a83ab
136c9bc234c
143c055a97d
15234ed868b
hex153767633

5695239731 has 2 divisors, whose sum is σ = 5695239732. Its totient is φ = 5695239730.

The previous prime is 5695239713. The next prime is 5695239743. The reversal of 5695239731 is 1379325965.

It is a happy number.

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

It is a strong prime.

It is a cyclic number.

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

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

It is a self number, because there is not a number n which added to its sum of digits gives 5695239731.

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

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

Almost surely, 25695239731 is an apocalyptic number.

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

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

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

The product of its digits is 1530900, while the sum is 50.

The square root of 5695239731 is about 75466.8121163204. The cubic root of 5695239731 is about 1785.8185775989.

The spelling of 5695239731 in words is "five billion, six hundred ninety-five million, two hundred thirty-nine thousand, seven hundred thirty-one".