Search a number
-
+
1001100110113 is a prime number
BaseRepresentation
bin11101001000101100011…
…01110110100100100001
310112201000101110210212001
432210112031312210201
5112400223112010423
62043522105404001
7132220123351105
oct16442615664441
93481011423761
101001100110113
11356622a05a04
1214202a499601
137353218767c
143664c5b3905
151b09311ecad
hexe916376921

1001100110113 has 2 divisors, whose sum is σ = 1001100110114. Its totient is φ = 1001100110112.

The previous prime is 1001100110081. The next prime is 1001100110117. The reversal of 1001100110113 is 3110110011001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 879530735889 + 121569374224 = 937833^2 + 348668^2 .

It is a cyclic number.

It is not a de Polignac number, because 1001100110113 - 25 = 1001100110081 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1001100110113.

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

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

Almost surely, 21001100110113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 1001100110113 its reverse (3110110011001), we get a palindrome (4111210121114).

The spelling of 1001100110113 in words is "one trillion, one billion, one hundred million, one hundred ten thousand, one hundred thirteen".