Search a number
-
+
110031111 = 3212225679
BaseRepresentation
bin1101000111011…
…11000100000111
321200001011022100
412203233010013
5211131443421
614530203143
72504151261
oct643570407
9250034270
10110031111
1157123003
1230a234b3
1319a46588
1410882b31
1599d6c26
hex68ef107

110031111 has 6 divisors (see below), whose sum is σ = 158933840. Its totient is φ = 73354068.

The previous prime is 110031107. The next prime is 110031113. The reversal of 110031111 is 111130011.

It is not a de Polignac number, because 110031111 - 22 = 110031107 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 12225679 = 110031111 / (1 + 1 + 0 + 0 + 3 + 1 + 1 + 1 + 1).

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110031113) by changing a digit.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6112831 + ... + 6112848.

Almost surely, 2110031111 is an apocalyptic number.

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

110031111 is a wasteful number, since it uses less digits than its factorization.

110031111 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 12225685 (or 12225682 counting only the distinct ones).

The product of its (nonzero) digits is 3, while the sum is 9.

The square root of 110031111 is about 10489.5715355776. The cubic root of 110031111 is about 479.1871529221.

Adding to 110031111 its reverse (111130011), we get a palindrome (221161122).

The spelling of 110031111 in words is "one hundred ten million, thirty-one thousand, one hundred eleven".

Divisors: 1 3 9 12225679 36677037 110031111