105501000 has 256 divisors, whose sum is σ = 377395200. Its totient is φ = 24288000.

The previous prime is 105500999. The next prime is 105501049. The reversal of 105501000 is 105501.

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

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

It is an unprimeable number.

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 63 ways as a sum of consecutive naturals, for example, 758931 + ... + 759069.

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

Almost surely, 2^105501000 is an apocalyptic number.

105501000 is a gapful number since it is divisible by the number (10) 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 105501000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (188697600).

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

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

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

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

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

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

The square root of 105501000 is about 10271.3679712101. The cubic root of 105501000 is about 472.5185457853.

Adding to 105501000 its reverse (105501), we get a palindrome (105606501).

105501000 divided by its reverse (105501) gives a cube (1000 = 10³).

It can be divided in two parts, 105 and 501000, that added together give a palindrome (501105).

The spelling of 105501000 in words is "one hundred five million, five hundred one thousand".