Search a number
-
+
5060105060057 is a prime number
BaseRepresentation
bin100100110100010010111…
…0000111011111011011001
3122220202000102101112110122
41021220211300323323121
51130401043343410212
614432325152323025
71031403056225315
oct111504560737331
918822012345418
105060105060057
111680a84431813
12698822b43475
132a9220517168
14136ca6186b45
158b9592c8272
hex49a25c3bed9

5060105060057 has 2 divisors, whose sum is σ = 5060105060058. Its totient is φ = 5060105060056.

The previous prime is 5060105060053. The next prime is 5060105060119. The reversal of 5060105060057 is 7500605010605.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4929550027081 + 130555032976 = 2220259^2 + 361324^2 .

It is a cyclic number.

It is not a de Polignac number, because 5060105060057 - 22 = 5060105060053 is a prime.

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

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

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

Almost surely, 25060105060057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 31500, while the sum is 35.

The spelling of 5060105060057 in words is "five trillion, sixty billion, one hundred five million, sixty thousand, fifty-seven".