Search a number
-
+
50555500502713 is a prime number
BaseRepresentation
bin10110111111010110111101…
…01001100001111010111001
320122000001120202100122012221
423133223132221201322321
523111300131112041323
6255304513141004041
713435341300660343
oct1337533651417271
9218001522318187
1050555500502713
1115121516066748
125805bb29b3621
13222949506c1ab
14c6ac838a6293
155ca0e7ea655d
hex2dfadea61eb9

50555500502713 has 2 divisors, whose sum is σ = 50555500502714. Its totient is φ = 50555500502712.

The previous prime is 50555500502701. The next prime is 50555500502719. The reversal of 50555500502713 is 31720500555505.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 44840326549264 + 5715173953449 = 6696292^2 + 2390643^2 .

It is a cyclic number.

It is not a de Polignac number, because 50555500502713 - 237 = 50418061549241 is a prime.

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

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

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

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

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

Almost surely, 250555500502713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 656250, while the sum is 43.

The spelling of 50555500502713 in words is "fifty trillion, five hundred fifty-five billion, five hundred million, five hundred two thousand, seven hundred thirteen".