Search a number
-
+
10111001143 is a prime number
BaseRepresentation
bin10010110101010100…
…11010001000110111
3222002122122002001211
421122222122020313
5131201404014033
64351145502251
7505363043305
oct113252321067
928078562054
1010111001143
11431943a8a1
121b621a1987
13c519b3419
146bcbb9275
153e29d72cd
hex25aa9a237

10111001143 has 2 divisors, whose sum is σ = 10111001144. Its totient is φ = 10111001142.

The previous prime is 10111001081. The next prime is 10111001161. The reversal of 10111001143 is 34110011101.

It is a happy number.

10111001143 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 is a cyclic number.

It is not a de Polignac number, because 10111001143 - 213 = 10110992951 is a prime.

It is a super-2 number, since 2×101110011432 (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 (10111001443) 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, 5055500571 + 5055500572.

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

Almost surely, 210111001143 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 12, while the sum is 13.

Adding to 10111001143 its reverse (34110011101), we get a palindrome (44221012244).

The spelling of 10111001143 in words is "ten billion, one hundred eleven million, one thousand, one hundred forty-three".