Search a number
-
+
101122210110137 is a prime number
BaseRepresentation
bin10110111111100001011001…
…011010011001101010111001
3111021001012002200121210102012
4112333201121122121222321
5101223241241242011022
6555022522500015305
730204560430531416
oct2677413132315271
9437035080553365
10101122210110137
112a2477633a1697
12b4121b3691535
134456a2545a208
141ad84abd1110d
15ba564a053de2
hex5bf859699ab9

101122210110137 has 2 divisors, whose sum is σ = 101122210110138. Its totient is φ = 101122210110136.

The previous prime is 101122210110121. The next prime is 101122210110139. The reversal of 101122210110137 is 731011012221101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 58886300935081 + 42235909175056 = 7673741^2 + 6498916^2 .

It is a cyclic number.

It is not a de Polignac number, because 101122210110137 - 24 = 101122210110121 is a prime.

Together with 101122210110139, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 2101122210110137 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 101122210110137 its reverse (731011012221101), we get a palindrome (832133222331238).

The spelling of 101122210110137 in words is "one hundred one trillion, one hundred twenty-two billion, two hundred ten million, one hundred ten thousand, one hundred thirty-seven".