Search a number
-
+
100112010110113 is a prime number
BaseRepresentation
bin10110110000110100100100…
…110011001110010010100001
3111010110121121010002200100111
4112300310210303032102201
5101110213344042010423
6552530453400051321
730041565636313111
oct2660644463162241
9433417533080314
10100112010110113
11299982a0879811
12b28a465763b41
1343b26a2c19c01
141aa1638d63041
15b892230c560d
hex5b0d24cce4a1

100112010110113 has 2 divisors, whose sum is σ = 100112010110114. Its totient is φ = 100112010110112.

The previous prime is 100112010110083. The next prime is 100112010110117. The reversal of 100112010110113 is 311011010211001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 99950966012304 + 161044097809 = 9997548^2 + 401303^2 .

It is a cyclic number.

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

It is a junction number, because it is equal to n+sod(n) for n = 100112010110093 and 100112010110102.

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

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

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

Almost surely, 2100112010110113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 13.

Adding to 100112010110113 its reverse (311011010211001), we get a palindrome (411123020321114).

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