Search a number
-
+
53435151114161 is a prime number
BaseRepresentation
bin11000010011001010101110…
…01100110101111110110001
321000012100110120000112011212
430021211113030311332301
524000440142141123121
6305351434115245505
714153363600212505
oct1411452714657661
9230170416015155
1053435151114161
11160317a1830533
125bb010bba9895
1323a7bb41b3c3b
14d2a3bcca8305
15629e86c2c25b
hex309957335fb1

53435151114161 has 2 divisors, whose sum is σ = 53435151114162. Its totient is φ = 53435151114160.

The previous prime is 53435151114109. The next prime is 53435151114253. The reversal of 53435151114161 is 16141115153435.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 43797659280400 + 9637491833761 = 6617980^2 + 3104431^2 .

It is a cyclic number.

It is not a de Polignac number, because 53435151114161 - 26 = 53435151114097 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 253435151114161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 108000, while the sum is 41.

Adding to 53435151114161 its reverse (16141115153435), we get a palindrome (69576266267596).

The spelling of 53435151114161 in words is "fifty-three trillion, four hundred thirty-five billion, one hundred fifty-one million, one hundred fourteen thousand, one hundred sixty-one".