Search a number
-
+
51264630651253 is a prime number
BaseRepresentation
bin10111010011111111110100…
…00110010111100101110101
320201111211222020211122012111
423221333322012113211311
523204404430421320003
6301010351325051021
713540514223534625
oct1351777206274565
9221454866748174
1051264630651253
111537523159a048
1258bb5190b6a71
13227b306c27696
14c933155c0885
155dd79d897e6d
hex2e9ffa197975

51264630651253 has 2 divisors, whose sum is σ = 51264630651254. Its totient is φ = 51264630651252.

The previous prime is 51264630651197. The next prime is 51264630651323. The reversal of 51264630651253 is 35215603646215.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 47622117170884 + 3642513480369 = 6900878^2 + 1908537^2 .

It is a cyclic number.

It is not a de Polignac number, because 51264630651253 - 221 = 51264628554101 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 251264630651253 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3888000, while the sum is 49.

The spelling of 51264630651253 in words is "fifty-one trillion, two hundred sixty-four billion, six hundred thirty million, six hundred fifty-one thousand, two hundred fifty-three".