Search a number
-
+
51432001464133 is a prime number
BaseRepresentation
bin10111011000110111100100…
…01011010110011101000101
320202002211222121112212122001
423230123302023112131011
523220130214333323013
6301215311342305301
713555560641140333
oct1354336213263505
9222084877485561
1051432001464133
111542a209aa6aa4
125927a49288231
13229102b25c834
14c9b471db8b53
155e2ce7499ddd
hex2ec6f22d6745

51432001464133 has 2 divisors, whose sum is σ = 51432001464134. Its totient is φ = 51432001464132.

The previous prime is 51432001464119. The next prime is 51432001464167. The reversal of 51432001464133 is 33146410023415.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 48970422464769 + 2461578999364 = 6997887^2 + 1568942^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-51432001464133 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 251432001464133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 103680, while the sum is 37.

Adding to 51432001464133 its reverse (33146410023415), we get a palindrome (84578411487548).

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