Search a number
-
+
50511050601017 is a prime number
BaseRepresentation
bin10110111110000100001010…
…01110100111001000111001
320121211210211222000200011112
423133002011032213020321
523110033112423213032
6255232242321210105
713432205631023246
oct1337020516471071
9217753758020145
1050511050601017
11151046862756a6
1257b9468790935
132225230104206
14c68a683105cd
155c8d959ca1b2
hex2df0853a7239

50511050601017 has 2 divisors, whose sum is σ = 50511050601018. Its totient is φ = 50511050601016.

The previous prime is 50511050600987. The next prime is 50511050601023. The reversal of 50511050601017 is 71010605011505.

50511050601017 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 can be written as a sum of positive squares in only one way, i.e., 43985294243881 + 6525756357136 = 6632141^2 + 2554556^2 .

It is a cyclic number.

It is not a de Polignac number, because 50511050601017 - 230 = 50509976859193 is a prime.

It is not a weakly prime, because it can be changed into another prime (50511050661017) 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, 25255525300508 + 25255525300509.

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

Almost surely, 250511050601017 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 50511050601017 in words is "fifty trillion, five hundred eleven billion, fifty million, six hundred one thousand, seventeen".