Search a number
-
+
50055050051051 is a prime number
BaseRepresentation
bin10110110000110010110010…
…11110100011110111101011
320120020012211111112121110112
423120121121132203313223
523030100220303113201
6254242550023004535
713354233542220563
oct1330313136436753
9216205744477415
1050055050051051
1114a49255904251
125745006b9974b
1321c122b7c6c96
14c5096a907da3
155bc0a7a460bb
hex2d86597a3deb

50055050051051 has 2 divisors, whose sum is σ = 50055050051052. Its totient is φ = 50055050051050.

The previous prime is 50055050051047. The next prime is 50055050051077. The reversal of 50055050051051 is 15015005055005.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 50055050051051 - 22 = 50055050051047 is a prime.

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

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

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

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

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

Almost surely, 250055050051051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 15625, while the sum is 32.

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