Search a number
-
+
102002210871137 is a prime number
BaseRepresentation
bin10111001100010100111101…
…100010111001011101100001
3111101011022112110022021021222
4113030110331202321131201
5101332201011440334022
61000535100242224425
730325262605554623
oct2714247542713541
9441138473267258
10102002210871137
112a556992932195
12b534866055115
1344bb9c8746b95
141b28d0d16cc13
15bbd4a1915242
hex5cc53d8b9761

102002210871137 has 2 divisors, whose sum is σ = 102002210871138. Its totient is φ = 102002210871136.

The previous prime is 102002210871079. The next prime is 102002210871151. The reversal of 102002210871137 is 731178012200201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 101613335158336 + 388875712801 = 10080344^2 + 623599^2 .

It is a cyclic number.

It is not a de Polignac number, because 102002210871137 - 212 = 102002210867041 is a prime.

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

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

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

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

Almost surely, 2102002210871137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9408, while the sum is 35.

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