Search a number
-
+
102211220021 is a prime number
BaseRepresentation
bin101111100110001000…
…0110111001000110101
3100202211021102221212112
41133030100313020311
53133312033020041
6114542153100405
710245614015051
oct1371420671065
9322737387775
10102211220021
113a390629469
12179863b7705
13983b96c061
144d389bcc61
1529d3420deb
hex17cc437235

102211220021 has 2 divisors, whose sum is σ = 102211220022. Its totient is φ = 102211220020.

The previous prime is 102211220017. The next prime is 102211220039. The reversal of 102211220021 is 120022112201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 99326455921 + 2884764100 = 315161^2 + 53710^2 .

It is a cyclic number.

It is not a de Polignac number, because 102211220021 - 22 = 102211220017 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

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

Almost surely, 2102211220021 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 32, while the sum is 14.

Adding to 102211220021 its reverse (120022112201), we get a palindrome (222233332222).

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