Search a number
-
+
2009559269 is a prime number
BaseRepresentation
bin111011111000111…
…0111000011100101
312012001100012002002
41313301313003211
513103421344034
6531223455045
7100540654244
oct16761670345
95161305062
102009559269
11941386693
12480bb7485
13260443433
14150c6695b
15bb64ee7e
hex77c770e5

2009559269 has 2 divisors, whose sum is σ = 2009559270. Its totient is φ = 2009559268.

The previous prime is 2009559241. The next prime is 2009559271. The reversal of 2009559269 is 9629559002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1641303169 + 368256100 = 40513^2 + 19190^2 .

It is a cyclic number.

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

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

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 22009559269 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 437400, while the sum is 47.

The square root of 2009559269 is about 44828.1080238727. The cubic root of 2009559269 is about 1261.9251809793.

The spelling of 2009559269 in words is "two billion, nine million, five hundred fifty-nine thousand, two hundred sixty-nine".