Search a number
-
+
110003311011 = 31111317294551
BaseRepresentation
bin110011001110010110…
…1010101000110100011
3101111221022122012020010
41212130231111012203
53300241321423021
6122311304420003
710642661500356
oct1463455250643
9344838565203
10110003311011
114271a001790
121939ba77603
13a4b10b8c99
14547780629d
152cdc54d976
hex199cb551a3

110003311011 has 16 divisors (see below), whose sum is σ = 160019497728. Its totient is φ = 66662556000.

The previous prime is 110003311007. The next prime is 110003311081. The reversal of 110003311011 is 110113300011.

It is not a de Polignac number, because 110003311011 - 22 = 110003311007 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2110003311011 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 305882.

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

Adding to 110003311011 its reverse (110113300011), we get a palindrome (220116611022).

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

Divisors: 1 3 11 33 11317 33951 124487 294551 373461 883653 3240061 9720183 3333433667 10000301001 36667770337 110003311011