Search a number
-
+
50115601013 is a prime number
BaseRepresentation
bin101110101011000111…
…110110001001110101
311210100122100022101212
4232223013312021311
51310114043213023
635004531131205
73422624402642
oct565307661165
9153318308355
1050115601013
111a287a4a885
129867743b05
1349589b65aa
1425d5c22dc9
151484acbe78
hexbab1f6275

50115601013 has 2 divisors, whose sum is σ = 50115601014. Its totient is φ = 50115601012.

The previous prime is 50115600949. The next prime is 50115601031. The reversal of 50115601013 is 31010651105.

Together with next prime (50115601031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 45548950084 + 4566650929 = 213422^2 + 67577^2 .

It is a cyclic number.

It is not a de Polignac number, because 50115601013 - 26 = 50115600949 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 50115601013.

It is a congruent number.

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

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

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

Almost surely, 250115601013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 450, while the sum is 23.

The spelling of 50115601013 in words is "fifty billion, one hundred fifteen million, six hundred one thousand, thirteen".