Search a number
-
+
3689157047 is a prime number
BaseRepresentation
bin1101101111100100…
…0001000110110111
3100112002210121002012
43123321001012313
530023411011142
61410023234435
7160264213622
oct33371010667
910462717065
103689157047
111623484324
1286b5a8a1b
1346a3c8484
1426dd5adb9
15168d23882
hexdbe411b7

3689157047 has 2 divisors, whose sum is σ = 3689157048. Its totient is φ = 3689157046.

The previous prime is 3689156971. The next prime is 3689157049. The reversal of 3689157047 is 7407519863.

It is a strong prime.

It is a cyclic number.

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

Together with 3689157049, 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 = 3689156986 and 3689157004.

It is a congruent number.

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

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

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

Almost surely, 23689157047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1270080, while the sum is 50.

The square root of 3689157047 is about 60738.4313840916. The cubic root of 3689157047 is about 1545.1680321917.

The spelling of 3689157047 in words is "three billion, six hundred eighty-nine million, one hundred fifty-seven thousand, forty-seven".