Search a number
-
+
2009593094921 is a prime number
BaseRepresentation
bin11101001111100101000…
…101010010001100001001
321010010002222221120020222
4131033211011102030021
5230411121313014141
64135105550155425
7265121406315566
oct35174505221411
97103088846228
102009593094921
11705299a04005
122855807b2b75
13117671b632b9
146d39c97186d
153741a2b114b
hex1d3e5152309

2009593094921 has 2 divisors, whose sum is σ = 2009593094922. Its totient is φ = 2009593094920.

The previous prime is 2009593094903. The next prime is 2009593094923. The reversal of 2009593094921 is 1294903959002.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1642526755321 + 367066339600 = 1281611^2 + 605860^2 .

It is a cyclic number.

It is not a de Polignac number, because 2009593094921 - 210 = 2009593093897 is a prime.

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

It is a Chen prime.

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

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

Almost surely, 22009593094921 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1574640, while the sum is 53.

The spelling of 2009593094921 in words is "two trillion, nine billion, five hundred ninety-three million, ninety-four thousand, nine hundred twenty-one".