51096150 has 96 divisors (see below), whose sum is σ = 160942080. Its totient is φ = 11676960.

The previous prime is 51096113. The next prime is 51096161. The reversal of 51096150 is 5169015.

51096150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

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

It is a Curzon number.

It is a congruent number.

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 47 ways as a sum of consecutive naturals, for example, 6747 + ... + 12153.

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

Almost surely, 2^51096150 is an apocalyptic number.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 1350, while the sum is 27.

The square root of 51096150 is about 7148.1571051565. The cubic root of 51096150 is about 371.0758799853.

The spelling of 51096150 in words is "fifty-one million, ninety-six thousand, one hundred fifty".