Search a number
-
+
111002101101 = 3299011245689
BaseRepresentation
bin110011101100000111…
…1011010010101101101
3101121111221000222122200
41213120033122111231
53304313014213401
6122554344132113
711006510202003
oct1473017322555
9347457028580
10111002101101
1143091879541
121961a467039
13a60ccc1538
14553031aa73
152d4a091686
hex19d83da56d

111002101101 has 12 divisors (see below), whose sum is σ = 160352690940. Its totient is φ = 73993867200.

The previous prime is 111002101099. The next prime is 111002101117. The reversal of 111002101101 is 101101200111.

It can be written as a sum of positive squares in 2 ways, for example, as 89164946025 + 21837155076 = 298605^2 + 147774^2 .

It is not a de Polignac number, because 111002101101 - 21 = 111002101099 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 533736 + ... + 711953.

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

Almost surely, 2111002101101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 111002101101 its reverse (101101200111), we get a palindrome (212103301212).

The spelling of 111002101101 in words is "one hundred eleven billion, two million, one hundred one thousand, one hundred one".

Divisors: 1 3 9 9901 29703 89109 1245689 3737067 11211201 12333566789 37000700367 111002101101