Search a number
-
+
50010056021 is a prime number
BaseRepresentation
bin101110100100110101…
…001110010101010101
311210002021202001220002
4232210311032111111
51304410033243041
634550241021045
73420203314412
oct564465162525
9153067661802
1050010056021
111a233411312
129838324785
13493cb80c33
1425c5bcb109
15147a6ce59b
hexba4d4e555

50010056021 has 2 divisors, whose sum is σ = 50010056022. Its totient is φ = 50010056020.

The previous prime is 50010055999. The next prime is 50010056027. The reversal of 50010056021 is 12065001005.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 39714909796 + 10295146225 = 199286^2 + 101465^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-50010056021 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

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

Almost surely, 250010056021 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 300, while the sum is 20.

Adding to 50010056021 its reverse (12065001005), we get a palindrome (62075057026).

The spelling of 50010056021 in words is "fifty billion, ten million, fifty-six thousand, twenty-one".