Search a number
-
+
3909564157 is a prime number
BaseRepresentation
bin1110100100000111…
…0011011011111101
3101002110112102210111
43221001303123331
531001322023112
61443535310021
7165611514142
oct35101633375
911073472714
103909564157
111726935464
1291137b311
134a3c79295
142913323c9
1517d35e5a7
hexe90736fd

3909564157 has 2 divisors, whose sum is σ = 3909564158. Its totient is φ = 3909564156.

The previous prime is 3909564119. The next prime is 3909564161. The reversal of 3909564157 is 7514659093.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3062404921 + 847159236 = 55339^2 + 29106^2 .

It is a cyclic number.

It is not a de Polignac number, because 3909564157 - 211 = 3909562109 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 3909564157.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 23909564157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1020600, while the sum is 49.

The square root of 3909564157 is about 62526.5076347624. The cubic root of 3909564157 is about 1575.3465812578.

The spelling of 3909564157 in words is "three billion, nine hundred nine million, five hundred sixty-four thousand, one hundred fifty-seven".