Search a number
-
+
111030113131 = 715861444733
BaseRepresentation
bin110011101100111101…
…0010001001101101011
3101121120212202010221021
41213121322101031223
53304342202110011
6123001224353311
711010300250510
oct1473172211553
9347525663837
10111030113131
11430a6671383
1219627915837
13a615a4b6c2
145533d2d307
152d4c776471
hex19d9e9136b

111030113131 has 4 divisors (see below), whose sum is σ = 126891557872. Its totient is φ = 95168668392.

The previous prime is 111030113123. The next prime is 111030113141. The reversal of 111030113131 is 131311030111.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 111030113131 - 23 = 111030113123 is a prime.

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

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7930722360 + ... + 7930722373.

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

Almost surely, 2111030113131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 15861444740.

The product of its (nonzero) digits is 27, while the sum is 16.

Adding to 111030113131 its reverse (131311030111), we get a palindrome (242341143242).

The spelling of 111030113131 in words is "one hundred eleven billion, thirty million, one hundred thirteen thousand, one hundred thirty-one".

Divisors: 1 7 15861444733 111030113131