Search a number
-
+
50056005061 is a prime number
BaseRepresentation
bin101110100111100100…
…100000010111000101
311210012111012112010101
4232213210200113011
51310003314130221
634555001524101
73421302010546
oct564744402705
9153174175111
1050056005061
111a257345527
12984b7a3631
13494954b50a
1425cbd4c4cd
15147e758d91
hexba79205c5

50056005061 has 2 divisors, whose sum is σ = 50056005062. Its totient is φ = 50056005060.

The previous prime is 50056005059. The next prime is 50056005101. The reversal of 50056005061 is 16050065005.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 45670254436 + 4385750625 = 213706^2 + 66225^2 .

It is a cyclic number.

It is not a de Polignac number, because 50056005061 - 21 = 50056005059 is a prime.

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

Together with 50056005059, it forms a pair of twin primes.

It is a congruent number.

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

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

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

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

Almost surely, 250056005061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 28.

The spelling of 50056005061 in words is "fifty billion, fifty-six million, five thousand, sixty-one".