103215500 has 48 divisors (see below), whose sum is σ = 238702464. Its totient is φ = 38854400.

The previous prime is 103215493. The next prime is 103215521. The reversal of 103215500 is 5512301.

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

It is an unprimeable number.

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

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

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

Almost surely, 2^103215500 is an apocalyptic number.

103215500 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 103215500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119351232).

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

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

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

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

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

The product of its (nonzero) digits is 150, while the sum is 17.

The square root of 103215500 is about 10159.5029405970. The cubic root of 103215500 is about 469.0815018017.

Adding to 103215500 its reverse (5512301), we get a palindrome (108727801).

The spelling of 103215500 in words is "one hundred three million, two hundred fifteen thousand, five hundred".