Search a number
-
+
11033311969 is a prime number
BaseRepresentation
bin10100100011010001…
…01111101011100001
31001110221010022200001
422101220233223201
5140044011440334
65022454100001
7540262414201
oct122150575341
931427108601
1011033311969
114752020649
12217b04a601
13106aabbc84
147694a2401
1544896e714
hex291a2fae1

11033311969 has 2 divisors, whose sum is σ = 11033311970. Its totient is φ = 11033311968.

The previous prime is 11033311937. The next prime is 11033311999. The reversal of 11033311969 is 96911333011.

11033311969 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10901865744 + 131446225 = 104412^2 + 11465^2 .

It is a cyclic number.

It is not a de Polignac number, because 11033311969 - 25 = 11033311937 is a prime.

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

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

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

Almost surely, 211033311969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13122, while the sum is 37.

The spelling of 11033311969 in words is "eleven billion, thirty-three million, three hundred eleven thousand, nine hundred sixty-nine".