Search a number
-
+
100112220202013 is a prime number
BaseRepresentation
bin10110110000110100110001…
…010100101010010000011101
3111010110122010202102110020222
4112300310301110222100131
5101110214311332431023
6552530530303051125
730041604100131665
oct2660646124522035
9433418122373228
10100112220202013
1129998399424988
12b28a503ba0aa5
1343b27075c8846
141aa1658c111a5
15b89236774cc8
hex5b0d3152a41d

100112220202013 has 2 divisors, whose sum is σ = 100112220202014. Its totient is φ = 100112220202012.

The previous prime is 100112220201971. The next prime is 100112220202051. The reversal of 100112220202013 is 310202022211001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 68009083484644 + 32103136717369 = 8246762^2 + 5665963^2 .

It is a cyclic number.

It is not a de Polignac number, because 100112220202013 - 26 = 100112220201949 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2100112220202013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 96, while the sum is 17.

Adding to 100112220202013 its reverse (310202022211001), we get a palindrome (410314242413014).

The spelling of 100112220202013 in words is "one hundred trillion, one hundred twelve billion, two hundred twenty million, two hundred two thousand, thirteen".