Search a number
-
+
105053715065977 is a prime number
BaseRepresentation
bin10111111000101110111001…
…010111100110110001111001
3111202222001000000210201202221
4113320232321113212301321
5102232200002024102402
61011233002131324041
731061610664343326
oct2770567127466171
9452861000721687
10105053715065977
1130523037456847
12b948144750621
1346806a4847202
141bd28ac46bb4d
15c22a4cac6337
hex5f8bb95e6c79

105053715065977 has 2 divisors, whose sum is σ = 105053715065978. Its totient is φ = 105053715065976.

The previous prime is 105053715065951. The next prime is 105053715066037. The reversal of 105053715065977 is 779560517350501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 93148344492921 + 11905370573056 = 9651339^2 + 3450416^2 .

It is a cyclic number.

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

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

It is not a weakly prime, because it can be changed into another prime (105053715065777) 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, 52526857532988 + 52526857532989.

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

Almost surely, 2105053715065977 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 34728750, while the sum is 61.

The spelling of 105053715065977 in words is "one hundred five trillion, fifty-three billion, seven hundred fifteen million, sixty-five thousand, nine hundred seventy-seven".