Search a number
-
+
17159141 is a prime number
BaseRepresentation
bin100000101110…
…1001111100101
31012021202220202
41001131033211
513343043031
61411440245
7265564436
oct101351745
935252822
1017159141
11975aa0a
1258b6085
13372a34c
1423c948d
15178e2cb
hex105d3e5

17159141 has 2 divisors, whose sum is σ = 17159142. Its totient is φ = 17159140.

The previous prime is 17159101. The next prime is 17159143. The reversal of 17159141 is 14195171.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13468900 + 3690241 = 3670^2 + 1921^2 .

It is a cyclic number.

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

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

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 217159141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1260, while the sum is 29.

The square root of 17159141 is about 4142.3593518670. The cubic root of 17159141 is about 257.9280140893.

The spelling of 17159141 in words is "seventeen million, one hundred fifty-nine thousand, one hundred forty-one".