Search a number
-
+
11020000105033 is a prime number
BaseRepresentation
bin1010000001011100101100…
…1100010001001001001001
31110000111112202101021122021
42200113023030101021021
52421022430011330113
635234303531124441
72215111606235413
oct240271314211111
943014482337567
1011020000105033
11356961284a937
12129b8bb8a3721
1361c248b3772a
142a15298879b3
151419c744648d
hexa05cb311249

11020000105033 has 2 divisors, whose sum is σ = 11020000105034. Its totient is φ = 11020000105032.

The previous prime is 11020000105001. The next prime is 11020000105039. The reversal of 11020000105033 is 33050100002011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7724130509824 + 3295869595209 = 2779232^2 + 1815453^2 .

It is a cyclic number.

It is not a de Polignac number, because 11020000105033 - 25 = 11020000105001 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 11020000104998 and 11020000105016.

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

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

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

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

Almost surely, 211020000105033 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 90, while the sum is 16.

Adding to 11020000105033 its reverse (33050100002011), we get a palindrome (44070100107044).

The spelling of 11020000105033 in words is "eleven trillion, twenty billion, one hundred five thousand, thirty-three".