Search a number
-
+
53050050053509 is a prime number
BaseRepresentation
bin11000000111111101011010…
…11000111000010110000101
320221211112110012102200201111
430003332231120320112011
523423133000303203014
6304454505003125021
714113511460210445
oct1403765530702605
9227745405380644
1053050050053509
11159a3444274853
125b49556513771
13237a7a1499452
14d158c9740125
1561ee483342c4
hex303fad638585

53050050053509 has 2 divisors, whose sum is σ = 53050050053510. Its totient is φ = 53050050053508.

The previous prime is 53050050053477. The next prime is 53050050053521. The reversal of 53050050053509 is 90535005005035.

53050050053509 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., 48371718980484 + 4678331073025 = 6954978^2 + 2162945^2 .

It is a cyclic number.

It is not a de Polignac number, because 53050050053509 - 25 = 53050050053477 is a prime.

It is a congruent number.

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

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

Almost surely, 253050050053509 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 253125, while the sum is 40.

The spelling of 53050050053509 in words is "fifty-three trillion, fifty billion, fifty million, fifty-three thousand, five hundred nine".