Search a number
-
+
11150000567 is a prime number
BaseRepresentation
bin10100110001001011…
…11000000110110111
31001210001200201022222
422120211320012313
5140313400004232
65042223112555
7543210304166
oct123045700667
931701621288
1011150000567
114801980502
1221b214275b
131089026894
1477ab993dd
15453d1dd12
hex2989781b7

11150000567 has 2 divisors, whose sum is σ = 11150000568. Its totient is φ = 11150000566.

The previous prime is 11150000551. The next prime is 11150000593. The reversal of 11150000567 is 76500005111.

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

It is an a-pointer prime, because the next prime (11150000593) can be obtained adding 11150000567 to its sum of digits (26).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 11150000567 - 24 = 11150000551 is a prime.

It is a congruent number.

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

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

Almost surely, 211150000567 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1050, while the sum is 26.

Adding to 11150000567 its reverse (76500005111), we get a palindrome (87650005678).

The spelling of 11150000567 in words is "eleven billion, one hundred fifty million, five hundred sixty-seven", and thus it is an aban number.