Search a number
-
+
111002111561 = 1112138319127
BaseRepresentation
bin110011101100000111…
…1011100111001001001
3101121111221001112000002
41213120033130321021
53304313020032221
6122554344252345
711006510244335
oct1473017347111
9347457045002
10111002111561
1143091886390
121961a4710b5
13a60ccc6223
1455303207c5
152d4a09480b
hex19d83dce49

111002111561 has 8 divisors (see below), whose sum is σ = 121193056704. Its totient is φ = 100827807120.

The previous prime is 111002111557. The next prime is 111002111579. The reversal of 111002111561 is 165111200111.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 111002111561 - 22 = 111002111557 is a prime.

It is a Duffinian number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4146221 + ... + 4172906.

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

Almost surely, 2111002111561 is an apocalyptic number.

111002111561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 8320351.

The product of its (nonzero) digits is 60, while the sum is 20.

Adding to 111002111561 its reverse (165111200111), we get a palindrome (276113311672).

The spelling of 111002111561 in words is "one hundred eleven billion, two million, one hundred eleven thousand, five hundred sixty-one".

Divisors: 1 11 1213 13343 8319127 91510397 10091101051 111002111561