Search a number
-
+
10111002111 = 327160492097
BaseRepresentation
bin10010110101010100…
…11010010111111111
3222002122122010101200
421122222122113333
5131201404031421
64351145510543
7505363046160
oct113252322777
928078563350
1010111002111
1143194405a1
121b621a2453
13c519b39b2
146bcbb9767
153e29d7726
hex25aa9a5ff

10111002111 has 12 divisors (see below), whose sum is σ = 16691178192. Its totient is φ = 5777715456.

The previous prime is 10111002079. The next prime is 10111002119. The reversal of 10111002111 is 11120011101.

It is not a de Polignac number, because 10111002111 - 25 = 10111002079 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 210111002111 is an apocalyptic number.

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

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

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

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

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

Adding to 10111002111 its reverse (11120011101), we get a palindrome (21231013212).

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

Divisors: 1 3 7 9 21 63 160492097 481476291 1123444679 1444428873 3370334037 10111002111