Search a number
-
+
11113141367 is a prime number
BaseRepresentation
bin10100101100110010…
…10001010001110111
31001200111100002000102
422112121101101313
5140224431010432
65034425104315
7542252100026
oct122631212167
931614302012
1011113141367
114793095659
1221a192809b
1310814bc7c3
14775d228bd
1545098c962
hex296651477

11113141367 has 2 divisors, whose sum is σ = 11113141368. Its totient is φ = 11113141366.

The previous prime is 11113141343. The next prime is 11113141397. The reversal of 11113141367 is 76314131111.

11113141367 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 11113141367 - 222 = 11108947063 is a prime.

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

It is a congruent number.

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

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

Almost surely, 211113141367 is an apocalyptic number.

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

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

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

The product of its digits is 1512, while the sum is 29.

Adding to 11113141367 its reverse (76314131111), we get a palindrome (87427272478).

The spelling of 11113141367 in words is "eleven billion, one hundred thirteen million, one hundred forty-one thousand, three hundred sixty-seven".