Search a number
-
+
11390626033 is a prime number
BaseRepresentation
bin10101001101110111…
…10010100011110001
31002101211110202102021
422212323302203301
5141312000013113
65122140351441
7552161503153
oct124673624361
932354422367
1011390626033
114915790a26
12225a845581
1310c6b36307
147a0b14ad3
1546a00048d
hex2a6ef28f1

11390626033 has 2 divisors, whose sum is σ = 11390626034. Its totient is φ = 11390626032.

The previous prime is 11390625943. The next prime is 11390626087. The reversal of 11390626033 is 33062609311.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11369530384 + 21095649 = 106628^2 + 4593^2 .

It is a cyclic number.

It is not a de Polignac number, because 11390626033 - 233 = 2800691441 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 11390626033.

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

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

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

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

Almost surely, 211390626033 is an apocalyptic number.

It is an amenable number.

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

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

11390626033 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 34.

The spelling of 11390626033 in words is "eleven billion, three hundred ninety million, six hundred twenty-six thousand, thirty-three".