Search a number
-
+
1715705141 is a prime number
BaseRepresentation
bin110011001000011…
…1001010100110101
311102120101211222212
41212100321110311
512003210031031
6442125303205
760342152543
oct14620712465
94376354885
101715705141
1180051a737
123ba704b05
132145b7b57
14123c12d93
15a095712b
hex66439535

1715705141 has 2 divisors, whose sum is σ = 1715705142. Its totient is φ = 1715705140.

The previous prime is 1715705119. The next prime is 1715705143. The reversal of 1715705141 is 1415075171.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 884824516 + 830880625 = 29746^2 + 28825^2 .

It is an emirp because it is prime and its reverse (1415075171) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1715705141 - 26 = 1715705077 is a prime.

Together with 1715705143, 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 = 1715705098 and 1715705107.

It is a congruent number.

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

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

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

Almost surely, 21715705141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1715705141 is about 41421.0712198514. The cubic root of 1715705141 is about 1197.1471910997.

The spelling of 1715705141 in words is "one billion, seven hundred fifteen million, seven hundred five thousand, one hundred forty-one".