Search a number
-
+
2090033519513 is a prime number
BaseRepresentation
bin11110011010011111101…
…101001001101110011001
321101210202000210112012212
4132122133231021232121
5233220342040111023
64240051555444505
7303666656536112
oct36323755115631
97353660715185
102090033519513
11736418486655
1229908bbb6735
131221212c1584
147322ddd5209
153957727ae78
hex1e69fb49b99

2090033519513 has 2 divisors, whose sum is σ = 2090033519514. Its totient is φ = 2090033519512.

The previous prime is 2090033519459. The next prime is 2090033519531. The reversal of 2090033519513 is 3159153300902.

Together with next prime (2090033519531) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1331099835289 + 758933684224 = 1153733^2 + 871168^2 .

It is a cyclic number.

It is not a de Polignac number, because 2090033519513 - 28 = 2090033519257 is a prime.

It is a super-2 number, since 2×20900335195132 (a number of 25 digits) contains 22 as substring.

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

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

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

Almost surely, 22090033519513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 109350, while the sum is 41.

The spelling of 2090033519513 in words is "two trillion, ninety billion, thirty-three million, five hundred nineteen thousand, five hundred thirteen".