Search a number
-
+
51547433293357 is a prime number
BaseRepresentation
bin10111011100001110100100…
…11100110101011000101101
320202111212221020220100220021
423232013102130311120231
523224023120410341412
6301344321451122141
713600115310404521
oct1356072234653055
9222455836810807
1051547433293357
1115474164289871
1259462a3143351
13229bb95bc2371
14ca2ca274bd81
155e5d01398607
hex2ee1d273562d

51547433293357 has 2 divisors, whose sum is σ = 51547433293358. Its totient is φ = 51547433293356.

The previous prime is 51547433293319. The next prime is 51547433293387. The reversal of 51547433293357 is 75339233474515.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 40256563177636 + 11290870115721 = 6344806^2 + 3360189^2 .

It is a cyclic number.

It is not a de Polignac number, because 51547433293357 - 211 = 51547433291309 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 251547433293357 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 142884000, while the sum is 61.

The spelling of 51547433293357 in words is "fifty-one trillion, five hundred forty-seven billion, four hundred thirty-three million, two hundred ninety-three thousand, three hundred fifty-seven".