Search a number
-
+
101101222213 is a prime number
BaseRepresentation
bin101111000101000011…
…0100011100101000101
3100122221220210020010121
41132022012203211011
53124023403102323
6114240102021541
710206245131615
oct1361206434505
9318856706117
10101101222213
1139971005702
12177167178b1
1396c29ca814
144c713daa45
15296ac62a5d
hex178a1a3945

101101222213 has 2 divisors, whose sum is σ = 101101222214. Its totient is φ = 101101222212.

The previous prime is 101101222207. The next prime is 101101222231. The reversal of 101101222213 is 312222101101.

Together with next prime (101101222231) 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., 100006472644 + 1094749569 = 316238^2 + 33087^2 .

It is a cyclic number.

It is not a de Polignac number, because 101101222213 - 213 = 101101214021 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2101101222213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 48, while the sum is 16.

Adding to 101101222213 its reverse (312222101101), we get a palindrome (413323323314).

The spelling of 101101222213 in words is "one hundred one billion, one hundred one million, two hundred twenty-two thousand, two hundred thirteen".