Search a number
-
+
111010131 = 3212334459
BaseRepresentation
bin1101001110111…
…10000101010011
321201212220021100
412213132011103
5211404311011
615003155443
72515366461
oct647360523
9251786240
10111010131
1157731611
1231215b83
1319cca08b
1410a59831
159b2bd56
hex69de153

111010131 has 6 divisors (see below), whose sum is σ = 160347980. Its totient is φ = 74006748.

The previous prime is 111010129. The next prime is 111010139. The reversal of 111010131 is 131010111.

It is not a de Polignac number, because 111010131 - 21 = 111010129 is a prime.

It is a super-2 number, since 2×1110101312 = 24646498369274322, which contains 22 as substring.

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: 12334459 = 111010131 / (1 + 1 + 1 + 0 + 1 + 0 + 1 + 3 + 1).

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (111010139) 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, 6167221 + ... + 6167238.

Almost surely, 2111010131 is an apocalyptic number.

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

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

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

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

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

The square root of 111010131 is about 10536.1345378654. The cubic root of 111010131 is about 480.6041741052.

Adding to 111010131 its reverse (131010111), we get a palindrome (242020242).

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

Divisors: 1 3 9 12334459 37003377 111010131