Search a number
-
+
10110122121111 = 3281911149107227
BaseRepresentation
bin1001001100011111001000…
…1111001101011110010111
31022210111222210102121212120
42103013302033031132113
52311121012230333421
633300305340151023
72062301152052055
oct223076217153627
938714883377776
1010110122121111
113248751404571
1211734ab538473
135844c3a4292c
1426d4926211d5
15127ec2b0e8c6
hex931f23cd797

10110122121111 has 16 divisors (see below), whose sum is σ = 13486280016000. Its totient is φ = 6737023304928.

The previous prime is 10110122121079. The next prime is 10110122121137. The reversal of 10110122121111 is 11112122101101.

It is not a de Polignac number, because 10110122121111 - 25 = 10110122121079 is a prime.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94233480 + ... + 94340706.

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

Almost surely, 210110122121111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 121198.

The product of its (nonzero) digits is 8, while the sum is 15.

Adding to 10110122121111 its reverse (11112122101101), we get a palindrome (21222244222212).

It can be divided in two parts, 10110 and 122121111, that added together give a palindrome (122131221).

The spelling of 10110122121111 in words is "ten trillion, one hundred ten billion, one hundred twenty-two million, one hundred twenty-one thousand, one hundred eleven".

Divisors: 1 3 2819 8457 11149 33447 107227 321681 31429031 94287093 302272913 906818739 1195473823 3586421469 3370040707037 10110122121111