[go: up one dir, main page]

Search a number
-
+
111556031 is a prime number
BaseRepresentation
bin1101010011000…
…11010110111111
321202220122002212
412221203112333
5212024243111
615023011035
72523132146
oct651432677
9252818085
10111556031
1157a74774
1231439a7b
131a15b6b2
1410b5c75d
159bd898b
hex6a635bf

111556031 has 2 divisors, whose sum is σ = 111556032. Its totient is φ = 111556030.

The previous prime is 111556013. The next prime is 111556037. The reversal of 111556031 is 130655111.

Together with previous prime (111556013) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 111556031 - 26 = 111555967 is a prime.

It is a super-3 number, since 3×1115560313 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 111555988 and 111556006.

It is a congruent number.

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

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

Almost surely, 2111556031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 450, while the sum is 23.

The square root of 111556031 is about 10562.0088524863. The cubic root of 111556031 is about 481.3906876920.

The spelling of 111556031 in words is "one hundred eleven million, five hundred fifty-six thousand, thirty-one".