Search a number
-
+
6738687257 is a prime number
BaseRepresentation
bin1100100011010100…
…00011010100011001
3122101122000210002112
412101222003110121
5102300100443012
63032401242105
7325663616351
oct62152032431
918348023075
106738687257
1129488a4525
121380933335
13835132313
1447cd77b61
152968ed122
hex191a83519

6738687257 has 2 divisors, whose sum is σ = 6738687258. Its totient is φ = 6738687256.

The previous prime is 6738687233. The next prime is 6738687259. The reversal of 6738687257 is 7527868376.

6738687257 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5561579776 + 1177107481 = 74576^2 + 34309^2 .

It is a cyclic number.

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

Together with 6738687259, 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 = 6738687196 and 6738687205.

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

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

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

Almost surely, 26738687257 is an apocalyptic number.

It is an amenable number.

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

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

6738687257 is an evil number, because the sum of its binary digits is even.

The product of its digits is 23708160, while the sum is 59.

The square root of 6738687257 is about 82089.5075938454. The cubic root of 6738687257 is about 1888.8251946167.

The spelling of 6738687257 in words is "six billion, seven hundred thirty-eight million, six hundred eighty-seven thousand, two hundred fifty-seven".