Search a number
-
+
101212102221193 is a prime number
BaseRepresentation
bin10111000000110101000111…
…011001100101110110001001
3111021100210010102111011201201
4113000311013121211312021
5101231224341132034233
6555132110423544201
730214222150055065
oct2700650731456611
9437323112434651
10101212102221193
112a2818a2123167
12b4277002bb061
13446234cb05c82
141adc998766aa5
15ba7b5bbbd77d
hex5c0d47665d89

101212102221193 has 2 divisors, whose sum is σ = 101212102221194. Its totient is φ = 101212102221192.

The previous prime is 101212102221157. The next prime is 101212102221199. The reversal of 101212102221193 is 391122201212101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 72232797024144 + 28979305197049 = 8498988^2 + 5383243^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 2101212102221193 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 864, while the sum is 28.

Adding to 101212102221193 its reverse (391122201212101), we get a palindrome (492334303433294).

The spelling of 101212102221193 in words is "one hundred one trillion, two hundred twelve billion, one hundred two million, two hundred twenty-one thousand, one hundred ninety-three".