Search a number
-
+
11164268953 is a prime number
BaseRepresentation
bin10100110010111000…
…10011100110011001
31001211001112121212201
422121130103212121
5140331023101303
65043453010201
7543442502035
oct123134234631
931731477781
1011164268953
114809a36562
1221b6a83961
13108bc81206
1477ca311c5
154551db81d
hex299713999

11164268953 has 2 divisors, whose sum is σ = 11164268954. Its totient is φ = 11164268952.

The previous prime is 11164268933. The next prime is 11164268959. The reversal of 11164268953 is 35986246111.

11164268953 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., 5644967689 + 5519301264 = 75133^2 + 74292^2 .

It is an emirp because it is prime and its reverse (35986246111) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11164268953 is a prime.

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

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

Almost surely, 211164268953 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 311040, while the sum is 46.

The spelling of 11164268953 in words is "eleven billion, one hundred sixty-four million, two hundred sixty-eight thousand, nine hundred fifty-three".