107061588 has 60 divisors (see below), whose sum is σ = 284520852. Its totient is φ = 35095680.

The previous prime is 107061557. The next prime is 107061589. The reversal of 107061588 is 885160701.

107061588 is a `hidden beast` number, since 1 + 0 + 70 + 6 + 1 + 588 = 666.

It can be written as a sum of positive squares in 2 ways, for example, as 5817744 + 101243844 = 2412^2 + 10062^2 .

It is a super-2 number, since 2×107061588² = 22924367250163488, which contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (36).

It is a congruent number.

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

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

It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 17056 + ... + 22472.

Almost surely, 2^107061588 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 13440, while the sum is 36.

The square root of 107061588 is about 10347.0569728788. The cubic root of 107061588 is about 474.8370085281.

The spelling of 107061588 in words is "one hundred seven million, sixty-one thousand, five hundred eighty-eight".