Search a number
-
+
105075758561 is a prime number
BaseRepresentation
bin110000111011100000…
…0001101010111100001
3101001012220120121000112
41201313000031113201
53210143343233221
6120134322101105
710406606132264
oct1416700152741
9331186517015
10105075758561
1140620587694
12184457aa795
139ba7274c87
14512b202cdb
152aeeb5815b
hex187700d5e1

105075758561 has 2 divisors, whose sum is σ = 105075758562. Its totient is φ = 105075758560.

The previous prime is 105075758549. The next prime is 105075758563. The reversal of 105075758561 is 165857570501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 102000390625 + 3075367936 = 319375^2 + 55456^2 .

It is a cyclic number.

It is not a de Polignac number, because 105075758561 - 218 = 105075496417 is a prime.

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

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

It is a Chen prime.

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

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

Almost surely, 2105075758561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1470000, while the sum is 50.

The spelling of 105075758561 in words is "one hundred five billion, seventy-five million, seven hundred fifty-eight thousand, five hundred sixty-one".