Search a number
-
+
105056050110 = 23511318351667
BaseRepresentation
bin110000111010111010…
…1000001101110111110
3101001011112111022002220
41201311311001232332
53210123322100420
6120132335430210
710406246456244
oct1416565015676
9331145438086
10105056050110
1140610446410
121843b085366
139ba316447b
145128752794
152aed063840
hex1875d41bbe

105056050110 has 32 divisors (see below), whose sum is σ = 275055841152. Its totient is φ = 25468133280.

The previous prime is 105056050109. The next prime is 105056050129. The reversal of 105056050110 is 11050650501.

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2105056050110 is an apocalyptic number.

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

105056050110 is an abundant number, since it is smaller than the sum of its proper divisors (169999791042).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 318351688.

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

Subtracting from 105056050110 its reverse (11050650501), we obtain a square (94005399609 = 3066032).

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

Divisors: 1 2 3 5 6 10 11 15 22 30 33 55 66 110 165 330 318351667 636703334 955055001 1591758335 1910110002 3183516670 3501868337 4775275005 7003736674 9550550010 10505605011 17509341685 21011210022 35018683370 52528025055 105056050110