Search a number
-
+
1100320020113 is a prime number
BaseRepresentation
bin10000000000110000001…
…011110001011010010001
310220012010012020110210112
4100000300023301122101
5121011423411120423
62201251404411105
7142331645565536
oct20006013613221
93805105213715
101100320020113
11394708a69926
121592bab46a95
137c9b51956a2
143b381bacd8d
151d94db16a78
hex100302f1691

1100320020113 has 2 divisors, whose sum is σ = 1100320020114. Its totient is φ = 1100320020112.

The previous prime is 1100320020091. The next prime is 1100320020127. The reversal of 1100320020113 is 3110200230011.

It is an a-pointer prime, because the next prime (1100320020127) can be obtained adding 1100320020113 to its sum of digits (14).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 616449530449 + 483870489664 = 785143^2 + 695608^2 .

It is a cyclic number.

It is not a de Polignac number, because 1100320020113 - 216 = 1100319954577 is a prime.

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

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

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

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

Almost surely, 21100320020113 is an apocalyptic number.

It is an amenable number.

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

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

1100320020113 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 36, while the sum is 14.

Adding to 1100320020113 its reverse (3110200230011), we get a palindrome (4210520250124).

The spelling of 1100320020113 in words is "one trillion, one hundred billion, three hundred twenty million, twenty thousand, one hundred thirteen".