Search a number
-
+
105056050111 = 9712713165099
BaseRepresentation
bin110000111010111010…
…1000001101110111111
3101001011112111022002221
41201311311001232333
53210123322100421
6120132335430211
710406246456245
oct1416565015677
9331145438087
10105056050111
1140610446411
121843b085367
139ba316447c
145128752795
152aed063841
hex1875d41bbf

105056050111 has 16 divisors (see below), whose sum is σ = 107793100800. Its totient is φ = 102365303040.

The previous prime is 105056050109. The next prime is 105056050129. The reversal of 105056050111 is 111050650501.

It is a cyclic number.

It is not a de Polignac number, because 105056050111 - 21 = 105056050109 is a prime.

It is a super-2 number, since 2×1050560501112 (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 (105056050511) 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, 1581240 + ... + 1646338.

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

Almost surely, 2105056050111 is an apocalyptic number.

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

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

105056050111 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 65454.

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

It can be divided in two parts, 1050560501 and 11, that multiplied together give a palindrome (11556165511).

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

Divisors: 1 97 127 131 12319 12707 16637 65099 1613789 6314603 8267573 8527969 801954581 827212993 1083052063 105056050111