Search a number
-
+
11110505105053 is a prime number
BaseRepresentation
bin1010000110101101110110…
…1101011100011010011101
31110100011011012111122120001
42201223131231130122131
52424013303301330203
635344032351254301
72224464450112264
oct241533555343235
943304135448501
1011110505105053
1135a3a36532a12
1212b535981a391
13627940472893
142a5a7387d5db
15144022cc791d
hexa1addb5c69d

11110505105053 has 2 divisors, whose sum is σ = 11110505105054. Its totient is φ = 11110505105052.

The previous prime is 11110505104997. The next prime is 11110505105087. The reversal of 11110505105053 is 35050150501111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9512702927289 + 1597802177764 = 3084267^2 + 1264042^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 211110505105053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1875, while the sum is 28.

Adding to 11110505105053 its reverse (35050150501111), we get a palindrome (46160655606164).

The spelling of 11110505105053 in words is "eleven trillion, one hundred ten billion, five hundred five million, one hundred five thousand, fifty-three".