Search a number
-
+
102213122010971 is a prime number
BaseRepresentation
bin10111001111011001011000…
…110101000010111101011011
3111101220110221012211021210112
4113033121120311002331123
5101344124433213322341
61001220020544034535
730346440306640136
oct2717313065027533
9441813835737715
10102213122010971
112a628383759224
12b569707902a4b
13450586b44a4ca
141b351da3cd21d
15bc3be7c24aeb
hex5cf658d42f5b

102213122010971 has 2 divisors, whose sum is σ = 102213122010972. Its totient is φ = 102213122010970.

The previous prime is 102213122010917. The next prime is 102213122011067. The reversal of 102213122010971 is 179010221312201.

Together with previous prime (102213122010917) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 102213122010971 - 238 = 101938244104027 is a prime.

It is a super-2 number, since 2×1022131220109712 (a number of 29 digits) contains 22 as substring.

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

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

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

Almost surely, 2102213122010971 is an apocalyptic number.

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

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

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

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

The spelling of 102213122010971 in words is "one hundred two trillion, two hundred thirteen billion, one hundred twenty-two million, ten thousand, nine hundred seventy-one".