Search a number
-
+
50050555055051 is a prime number
BaseRepresentation
bin10110110000101010011011…
…00011100000101111001011
320120012210020020102011011012
423120111031203200233023
523030012014043230201
6254240524011354135
713354014261331145
oct1330251543405713
9216183206364135
1050050555055051
1114a47359571221
12574417175294b
1321c0993483035
14c50661941c95
155bbde30e55bb
hex2d854d8e0bcb

50050555055051 has 2 divisors, whose sum is σ = 50050555055052. Its totient is φ = 50050555055050.

The previous prime is 50050555054999. The next prime is 50050555055057. The reversal of 50050555055051 is 15055055505005.

50050555055051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 50050555055051 - 226 = 50050487946187 is a prime.

It is a super-2 number, since 2×500505550550512 (a number of 28 digits) contains 22 as substring.

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

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

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

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

Almost surely, 250050555055051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 390625, while the sum is 41.

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