15051100000 has 144 divisors (see below), whose sum is σ = 37951133472. Its totient is φ = 5872000000.

The previous prime is 15051099997. The next prime is 15051100039. The reversal of 15051100000 is 115051.

It is a super-2 number, since 2×15051100000² (a number of 21 digits) contains 22 as substring.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4098165 + ... + 4101835.

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

Almost surely, 2^15051100000 is an apocalyptic number.

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

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

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

15051100000 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 15051100000 its reverse (115051), we get a palindrome (15051215051).

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