Search a number
-
+
10111020101057 is a prime number
BaseRepresentation
bin1001001100100010011111…
…0000101110110111000001
31022210121022101010201210002
42103020213300232313001
52311124332121213212
633300534415045345
72062332334545311
oct223104760566701
938717271121702
1010111020101057
113249072287157
121173700210855
13584607aaca05
1426d5399b3441
1512802688cac2
hex93227c2edc1

10111020101057 has 2 divisors, whose sum is σ = 10111020101058. Its totient is φ = 10111020101056.

The previous prime is 10111020101023. The next prime is 10111020101081. The reversal of 10111020101057 is 75010102011101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6559996440001 + 3551023661056 = 2561249^2 + 1884416^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 210111020101057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 70, while the sum is 20.

Adding to 10111020101057 its reverse (75010102011101), we get a palindrome (85121122112158).

The spelling of 10111020101057 in words is "ten trillion, one hundred eleven billion, twenty million, one hundred one thousand, fifty-seven".