Search a number
-
+
20113133111033 is a prime number
BaseRepresentation
bin1001001001010111101000…
…01001111000011011111001
32122012210111211101000101012
410210223310021320123321
510114013144034023113
6110435502405203305
74144061121423554
oct444536411703371
978183454330335
1020113133111033
116454a28324906
12230a087700535
13b2b87792c9a1
144d76a35b769b
1524d2c7067aa8
hex124af42786f9

20113133111033 has 2 divisors, whose sum is σ = 20113133111034. Its totient is φ = 20113133111032.

The previous prime is 20113133111021. The next prime is 20113133111041. The reversal of 20113133111033 is 33011133131102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 19404350971369 + 708782139664 = 4405037^2 + 841892^2 .

It is a cyclic number.

It is not a de Polignac number, because 20113133111033 - 222 = 20113128916729 is a prime.

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

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

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

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

Almost surely, 220113133111033 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 23.

Adding to 20113133111033 its reverse (33011133131102), we get a palindrome (53124266242135).

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