Search a number
-
+
53550453137 is a prime number
BaseRepresentation
bin110001110111110110…
…110001000110010001
312010020000121212201012
4301313312301012101
51334132404000022
640333432020305
73604013225036
oct616766610621
9163200555635
1053550453137
112078a920045
12a465b31695
1350854c2a7c
1428400a338d
1515d641ade2
hexc77db1191

53550453137 has 2 divisors, whose sum is σ = 53550453138. Its totient is φ = 53550453136.

The previous prime is 53550453109. The next prime is 53550453139. The reversal of 53550453137 is 73135405535.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 50680815376 + 2869637761 = 225124^2 + 53569^2 .

It is a cyclic number.

It is not a de Polignac number, because 53550453137 - 28 = 53550452881 is a prime.

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 53550453094 and 53550453103.

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

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

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

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

Almost surely, 253550453137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 472500, while the sum is 41.

The spelling of 53550453137 in words is "fifty-three billion, five hundred fifty million, four hundred fifty-three thousand, one hundred thirty-seven".