Search a number
-
+
11368155863 is a prime number
BaseRepresentation
bin10101001011001100…
…00100101011010111
31002100021012011010202
422211212010223113
5141240221441423
65120015011115
7551466505361
oct124546045327
932307164122
1011368155863
114904033839
122253209a9b
1310c229975c
1479bb45d31
15468062728
hex2a5984ad7

11368155863 has 2 divisors, whose sum is σ = 11368155864. Its totient is φ = 11368155862.

The previous prime is 11368155857. The next prime is 11368155907. The reversal of 11368155863 is 36855186311.

11368155863 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 an emirp because it is prime and its reverse (36855186311) is a distict prime.

It is a cyclic number.

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

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

It is a Sophie Germain prime.

It is a congruent number.

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

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

Almost surely, 211368155863 is an apocalyptic number.

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

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

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

The product of its digits is 518400, while the sum is 47.

The spelling of 11368155863 in words is "eleven billion, three hundred sixty-eight million, one hundred fifty-five thousand, eight hundred sixty-three".