Search a number
-
+
105060838957 is a prime number
BaseRepresentation
bin110000111011000011…
…1010010111000101101
3101001011212111121011121
41201312013102320231
53210131033321312
6120133030220541
710406335253014
oct1416607227055
9331155447147
10105060838957
1140613117338
12184407b4751
139ba41500c9
14512923ba7b
152aed6ac707
hex18761d2e2d

105060838957 has 2 divisors, whose sum is σ = 105060838958. Its totient is φ = 105060838956.

The previous prime is 105060838913. The next prime is 105060838963. The reversal of 105060838957 is 759838060501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 72321193476 + 32739645481 = 268926^2 + 180941^2 .

It is a cyclic number.

It is not a de Polignac number, because 105060838957 - 227 = 104926621229 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2105060838957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1814400, while the sum is 52.

The spelling of 105060838957 in words is "one hundred five billion, sixty million, eight hundred thirty-eight thousand, nine hundred fifty-seven".