Search a number
-
+
105706655670 = 235711163383733
BaseRepresentation
bin110001001110010011…
…0111000111110110110
3101002211212201111011010
41202130212320332312
53212441400440140
6120321100253050
710431336514410
oct1423446707666
9332755644133
10105706655670
1140914718a60
12185a0b41186
139c77b9ac85
14518ad0d9b0
152b3a22a880
hex189c9b8fb6

105706655670 has 256 divisors, whose sum is σ = 319502942208. Its totient is φ = 21743562240.

The previous prime is 105706655657. The next prime is 105706655671. The reversal of 105706655670 is 76556607501.

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

It is a congruent number.

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

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 144210624 + ... + 144211356.

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

Almost surely, 2105706655670 is an apocalyptic number.

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

It is a practical number, because each smaller number is the sum of distinct divisors of 105706655670, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159751471104).

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

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

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

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

The sum of its prime factors is 1307.

The product of its (nonzero) digits is 1323000, while the sum is 48.

The spelling of 105706655670 in words is "one hundred five billion, seven hundred six million, six hundred fifty-five thousand, six hundred seventy".