Search a number
-
+
10020011101111 = 115955441278479
BaseRepresentation
bin1001000111001111011100…
…1100111100101110110111
31022110220101210122111221101
42101303313030330232313
52303131440320213421
633151043552230531
72052631134035044
oct221636714745667
938426353574841
1010020011101111
113213510055510
121159b4153b447
13578b62c1bc5b
14268d84aa41cb
1512599bb53191
hex91cf733cbb7

10020011101111 has 16 divisors (see below), whose sum is σ = 11116431475200. Its totient is φ = 8954515785600.

The previous prime is 10020011101103. The next prime is 10020011101123. The reversal of 10020011101111 is 11110111002001.

It is not a de Polignac number, because 10020011101111 - 23 = 10020011101103 is a prime.

It is a congruent number.

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

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

Almost surely, 210020011101111 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 333990.

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

Adding to 10020011101111 its reverse (11110111002001), we get a palindrome (21130122103112).

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

Divisors: 1 11 59 649 55441 278479 609851 3063269 3271019 16430261 35981209 180732871 15439154239 169830696629 910910100101 10020011101111