Search a number
-
+
105710106169 is a prime number
BaseRepresentation
bin110001001110011010…
…0000011011000111001
3101002212010012210100101
41202130310003120321
53212443241344134
6120321302235401
710431411035233
oct1423464033071
9332763183311
10105710106169
1140916665408
12185a2125b61
139c788086a5
14518b56b253
152b3a6ace14
hex189cd03639

105710106169 has 2 divisors, whose sum is σ = 105710106170. Its totient is φ = 105710106168.

The previous prime is 105710106167. The next prime is 105710106223. The reversal of 105710106169 is 961601017501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 57834478144 + 47875628025 = 240488^2 + 218805^2 .

It is a cyclic number.

It is not a de Polignac number, because 105710106169 - 21 = 105710106167 is a prime.

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

Together with 105710106167, it forms a pair of twin primes.

It is not a weakly prime, because it can be changed into another prime (105710106167) 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, 52855053084 + 52855053085.

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

Almost surely, 2105710106169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11340, while the sum is 37.

The spelling of 105710106169 in words is "one hundred five billion, seven hundred ten million, one hundred six thousand, one hundred sixty-nine".