Search a number
-
+
100022331213113 is a prime number
BaseRepresentation
bin10110101111100001000011…
…100001011000010100111001
3111010011001010020102200201212
4112233201003201120110321
5101102231213242304423
6552421342530052505
730032242416260651
oct2657410341302471
9433131106380655
10100022331213113
1129963261436101
12b274bb841a135
1343a70b07a3c0a
141a9b16c96d361
15b86c25025578
hex5af843858539

100022331213113 has 2 divisors, whose sum is σ = 100022331213114. Its totient is φ = 100022331213112.

The previous prime is 100022331213097. The next prime is 100022331213131. The reversal of 100022331213113 is 311312133220001.

Together with next prime (100022331213131) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 96426350974864 + 3595980238249 = 9819692^2 + 1896307^2 .

It is a cyclic number.

It is not a de Polignac number, because 100022331213113 - 24 = 100022331213097 is a prime.

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

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

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

Almost surely, 2100022331213113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 23.

Adding to 100022331213113 its reverse (311312133220001), we get a palindrome (411334464433114).

The spelling of 100022331213113 in words is "one hundred trillion, twenty-two billion, three hundred thirty-one million, two hundred thirteen thousand, one hundred thirteen".