Search a number
-
+
111905409131 = 259514312181
BaseRepresentation
bin110100000111000010…
…1010000100001101011
3101200211212202210022122
41220032011100201223
53313140241043011
6123224133141455
711041056166055
oct1501605204153
9350755683278
10111905409131
11435057601aa
1219830a8a88b
13a7251a5829
1455b82988d5
152d9e5233db
hex1a0e15086b

111905409131 has 4 divisors (see below), whose sum is σ = 111909747264. Its totient is φ = 111901071000.

The previous prime is 111905409107. The next prime is 111905409137. The reversal of 111905409131 is 131904509111.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131904509111 = 235734978657.

It is a cyclic number.

It is not a de Polignac number, because 111905409131 - 226 = 111838300267 is a prime.

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

It is a Duffinian number.

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

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

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

Almost surely, 2111905409131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4338132.

The product of its (nonzero) digits is 4860, while the sum is 35.

The spelling of 111905409131 in words is "one hundred eleven billion, nine hundred five million, four hundred nine thousand, one hundred thirty-one".

Divisors: 1 25951 4312181 111905409131