Search a number
-
+
105510100111 = 1322327144353
BaseRepresentation
bin110001001000011100…
…1000101110010001111
3101002100011212102121121
41202100321011302033
53212041041200421
6120245355341411
710423432024213
oct1422071056217
9332304772547
10105510100111
1140823778949
1218547151867
139c4624b700
14516cb86943
152b27d51d41
hex1890e45c8f

105510100111 has 12 divisors (see below), whose sum is σ = 119218002768. Its totient is φ = 93159416064.

The previous prime is 105510100049. The next prime is 105510100133. The reversal of 105510100111 is 111001015501.

It is not a de Polignac number, because 105510100111 - 229 = 104973229199 is a prime.

It is a super-2 number, since 2×1055101001112 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 2105510100111 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 25, while the sum is 16.

Adding to 105510100111 its reverse (111001015501), we get a palindrome (216511115612).

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

Divisors: 1 13 23 169 299 3887 27144353 352876589 624320119 4587395657 8116161547 105510100111