Search a number
-
+
171014531 is a prime number
BaseRepresentation
bin10100011000101…
…11100110000011
3102220210102211112
422030113212003
5322234431111
624545233535
74144412432
oct1214274603
9386712745
10171014531
1188595826
12493328ab
132957903c
14189d9119
1510030e8b
hexa317983

171014531 has 2 divisors, whose sum is σ = 171014532. Its totient is φ = 171014530.

The previous prime is 171014527. The next prime is 171014533. The reversal of 171014531 is 135410171.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 171014531 - 22 = 171014527 is a prime.

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

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 171014497 and 171014506.

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

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

Almost surely, 2171014531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 420, while the sum is 23.

The square root of 171014531 is about 13077.2524254906. The cubic root of 171014531 is about 555.0656319321.

The spelling of 171014531 in words is "one hundred seventy-one million, fourteen thousand, five hundred thirty-one".