Search a number
-
+
105011056111 = 1341197018867
BaseRepresentation
bin110000111001100100…
…1011000110111101111
3101001001101211100221111
41201303021120313233
53210030312243421
6120124051212451
710405162151353
oct1416311306757
9331041740844
10105011056111
1140598004795
1218427ba7127
139b96a3c7c0
14512279d463
152ae9126ee1
hex1873258def

105011056111 has 8 divisors (see below), whose sum is σ = 115847094384. Its totient is φ = 94569055680.

The previous prime is 105011056061. The next prime is 105011056141. The reversal of 105011056111 is 111650110501.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 105011056111 - 213 = 105011047919 is a prime.

It is a super-2 number, since 2×1050110561112 (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 (105011056141) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 98508901 + ... + 98509966.

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

Almost surely, 2105011056111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 197018921.

The product of its (nonzero) digits is 150, while the sum is 22.

Adding to 105011056111 its reverse (111650110501), we get a palindrome (216661166612).

The spelling of 105011056111 in words is "one hundred five billion, eleven million, fifty-six thousand, one hundred eleven".

Divisors: 1 13 41 533 197018867 2561245271 8077773547 105011056111