Search a number
-
+
51103005312547 is a prime number
BaseRepresentation
bin10111001111010010110000…
…11110101000011000100011
320200221101210022020201122201
423213221120132220120203
523144232423330000142
6300404221353114031
713523033053035616
oct1347513036503043
9220841708221581
1051103005312547
1115312732278961
1258941310b8917
132268cba0228a6
14c89581c9c17d
155d948e3a3ab7
hex2e7a587a8623

51103005312547 has 2 divisors, whose sum is σ = 51103005312548. Its totient is φ = 51103005312546.

The previous prime is 51103005312497. The next prime is 51103005312563. The reversal of 51103005312547 is 74521350030115.

51103005312547 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 51103005312547 - 27 = 51103005312419 is a prime.

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

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

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

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

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

Almost surely, 251103005312547 is an apocalyptic number.

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

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

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

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

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