Search a number
-
+
5603131603757 is a prime number
BaseRepresentation
bin101000110001001010010…
…1010110011101100101101
3201211122122212122010122202
41101202110222303230231
51213300203142310012
615530013151551245
71115545552543232
oct121422452635455
921748585563582
105603131603757
111870302798336
12765b1152b525
133184b076373c
1415529b8cd789
159ab3c47bcc2
hex51894ab3b2d

5603131603757 has 2 divisors, whose sum is σ = 5603131603758. Its totient is φ = 5603131603756.

The previous prime is 5603131603733. The next prime is 5603131603759. The reversal of 5603131603757 is 7573061313065.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3588679373161 + 2014452230596 = 1894381^2 + 1419314^2 .

It is a cyclic number.

It is not a de Polignac number, because 5603131603757 - 212 = 5603131599661 is a prime.

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

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 25603131603757 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1190700, while the sum is 47.

The spelling of 5603131603757 in words is "five trillion, six hundred three billion, one hundred thirty-one million, six hundred three thousand, seven hundred fifty-seven".