Search a number
-
+
50055550500541 is a prime number
BaseRepresentation
bin10110110000110011101110…
…10011100111111010111101
320120020021010101020002002211
423120121313103213322331
523030102231412004131
6254243111421220421
713354252130036155
oct1330316723477275
9216207111202084
1050055550500541
1114a49492348373
125745126701711
1321c12ab3a8841
14c509b7179765
155bc0d694c5b1
hex2d86774e7ebd

50055550500541 has 2 divisors, whose sum is σ = 50055550500542. Its totient is φ = 50055550500540.

The previous prime is 50055550500509. The next prime is 50055550500577. The reversal of 50055550500541 is 14500505555005.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 36293335116025 + 13762215384516 = 6024395^2 + 3709746^2 .

It is a cyclic number.

It is not a de Polignac number, because 50055550500541 - 25 = 50055550500509 is a prime.

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

It is a congruent number.

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

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

Almost surely, 250055550500541 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 312500, while the sum is 40.

The spelling of 50055550500541 in words is "fifty trillion, fifty-five billion, five hundred fifty million, five hundred thousand, five hundred forty-one".