Search a number
-
+
11035405127 is a prime number
BaseRepresentation
bin10100100011100001…
…01110101101000111
31001111002001122221102
422101300232231013
5140100030431002
65023011010315
7540316252535
oct122160565507
931432048842
1011035405127
11475322022a
12217b89999b
13106b372926
14769889155
15448c34a02
hex291c2eb47

11035405127 has 2 divisors, whose sum is σ = 11035405128. Its totient is φ = 11035405126.

The previous prime is 11035405093. The next prime is 11035405169. The reversal of 11035405127 is 72150453011.

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

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 11035405127 - 210 = 11035404103 is a prime.

It is a super-2 number, since 2×110354051272 (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 11035405127.

It is a congruent number.

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

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

Almost surely, 211035405127 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4200, while the sum is 29.

Adding to 11035405127 its reverse (72150453011), we get a palindrome (83185858138).

The spelling of 11035405127 in words is "eleven billion, thirty-five million, four hundred five thousand, one hundred twenty-seven".