Search a number
-
+
105670110209 is a prime number
BaseRepresentation
bin110001001101001101…
…1011110110000000001
3101002202022221210012112
41202122123132300001
53212403022011314
6120313313105105
710430414055026
oct1423233366001
9332668853175
10105670110209
11408a60278a4
1218590858195
139c70443941
14518611954d
152b36e0c43e
hex189a6dec01

105670110209 has 2 divisors, whose sum is σ = 105670110210. Its totient is φ = 105670110208.

The previous prime is 105670110197. The next prime is 105670110233. The reversal of 105670110209 is 902011076501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 93068925184 + 12601185025 = 305072^2 + 112255^2 .

It is an emirp because it is prime and its reverse (902011076501) is a distict prime.

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 2105670110209 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 105670110209 in words is "one hundred five billion, six hundred seventy million, one hundred ten thousand, two hundred nine".