Search a number
-
+
20133120113369 is a prime number
BaseRepresentation
bin1001001001111100110110…
…11110001111101011011001
32122021201002202102221011222
410210332123132033223121
510114330112222111434
6110453005552101425
74145366325224444
oct444763336175331
978251082387158
1020133120113369
11646245448655a
122311b25234875
13b307117064a3
144d863bc7865b
1524da96ab772e
hex124f9b78fad9

20133120113369 has 2 divisors, whose sum is σ = 20133120113370. Its totient is φ = 20133120113368.

The previous prime is 20133120113299. The next prime is 20133120113383. The reversal of 20133120113369 is 96331102133102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 19631589870025 + 501530243344 = 4430755^2 + 708188^2 .

It is a cyclic number.

It is not a de Polignac number, because 20133120113369 - 224 = 20133103336153 is a prime.

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

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

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

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

Almost surely, 220133120113369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 17496, while the sum is 35.

The spelling of 20133120113369 in words is "twenty trillion, one hundred thirty-three billion, one hundred twenty million, one hundred thirteen thousand, three hundred sixty-nine".