Search a number
-
+
50519811053 is a prime number
BaseRepresentation
bin101111000011001101…
…110010001111101101
311211101210221022100002
4233003031302033231
51311431032423203
635113010514045
73435633210605
oct570315621755
9154353838302
1050519811053
111a475130868
12995ab95925
1349c167022a
1426337a1c05
1514aa322d88
hexbc33723ed

50519811053 has 2 divisors, whose sum is σ = 50519811054. Its totient is φ = 50519811052.

The previous prime is 50519810987. The next prime is 50519811091. The reversal of 50519811053 is 35011891505.

It is an a-pointer prime, because the next prime (50519811091) can be obtained adding 50519811053 to its sum of digits (38).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 50253533929 + 266277124 = 224173^2 + 16318^2 .

It is a cyclic number.

It is not a de Polignac number, because 50519811053 - 216 = 50519745517 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 250519811053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27000, while the sum is 38.

The spelling of 50519811053 in words is "fifty billion, five hundred nineteen million, eight hundred eleven thousand, fifty-three".