Search a number
-
+
51103005312497 is a prime number
BaseRepresentation
bin10111001111010010110000…
…11110101000010111110001
320200221101210022020201120212
423213221120132220113301
523144232423324444442
6300404221353113505
713523033053035515
oct1347513036502761
9220841708221525
1051103005312497
1115312732278916
1258941310b8895
132268cba022868
14c89581c9c145
155d948e3a3a82
hex2e7a587a85f1

51103005312497 has 2 divisors, whose sum is σ = 51103005312498. Its totient is φ = 51103005312496.

The previous prime is 51103005312481. The next prime is 51103005312547. The reversal of 51103005312497 is 79421350030115.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 47032150284001 + 4070855028496 = 6857999^2 + 2017636^2 .

It is a cyclic number.

It is not a de Polignac number, because 51103005312497 - 24 = 51103005312481 is a prime.

It is a super-2 number, since 2×511030053124972 (a number of 28 digits) contains 22 as substring.

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

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

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

Almost surely, 251103005312497 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 51103005312497 in words is "fifty-one trillion, one hundred three billion, five million, three hundred twelve thousand, four hundred ninety-seven".