1050152100 has 72 divisors (see below), whose sum is σ = 3049888128. Its totient is φ = 278985600.

The previous prime is 1050152099. The next prime is 1050152111. The reversal of 1050152100 is 12510501.

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

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

It is a self number, because there is not a number n which added to its sum of digits gives 1050152100.

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 23 ways as a sum of consecutive naturals, for example, 74842 + ... + 87758.

Almost surely, 2^1050152100 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 50, while the sum is 15.

The square root of 1050152100 is about 32406.0503610051. The cubic root of 1050152100 is about 1016.4454318694.

Adding to 1050152100 its reverse (12510501), we get a palindrome (1062662601).

The spelling of 1050152100 in words is "one billion, fifty million, one hundred fifty-two thousand, one hundred".