Search a number
-
+
50555433391613 is a prime number
BaseRepresentation
bin10110111111010110110101…
…01001100001010111111101
320122000001102002002001002122
423133223122221201113331
523111300011422012423
6255304502342332325
713435336524355223
oct1337533251412775
9218001362061078
1050555433391613
1115121491199127
125805b9442a0a5
1322294841a2597
14c6ac789d6b13
155ca0e214b8c8
hex2dfadaa615fd

50555433391613 has 2 divisors, whose sum is σ = 50555433391614. Its totient is φ = 50555433391612.

The previous prime is 50555433391607. The next prime is 50555433391633. The reversal of 50555433391613 is 31619333455505.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 32455148151364 + 18100285240249 = 5696942^2 + 4254443^2 .

It is a cyclic number.

It is not a de Polignac number, because 50555433391613 - 26 = 50555433391549 is a prime.

It is a congruent number.

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

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

Almost surely, 250555433391613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10935000, while the sum is 53.

The spelling of 50555433391613 in words is "fifty trillion, five hundred fifty-five billion, four hundred thirty-three million, three hundred ninety-one thousand, six hundred thirteen".