Search a number
-
+
105591713 is a prime number
BaseRepresentation
bin1100100101100…
…11001110100001
321100200121121012
412102303032201
5204012413323
614251110305
72421341363
oct622631641
9240617535
10105591713
1154670687
122b442395
1318b50a06
1410048d33
15940b678
hex64b33a1

105591713 has 2 divisors, whose sum is σ = 105591714. Its totient is φ = 105591712.

The previous prime is 105591701. The next prime is 105591719. The reversal of 105591713 is 317195501.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 76247824 + 29343889 = 8732^2 + 5417^2 .

It is a cyclic number.

It is not a de Polignac number, because 105591713 - 28 = 105591457 is a prime.

It is a super-2 number, since 2×1055917132 = 22299219708548738, which contains 22 as substring.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 105591713.

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

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

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

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

Almost surely, 2105591713 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 105591713 is about 10275.7828412243. The cubic root of 105591713 is about 472.6539356412.

The spelling of 105591713 in words is "one hundred five million, five hundred ninety-one thousand, seven hundred thirteen".