51265100 has 36 divisors (see below), whose sum is σ = 113143800. Its totient is φ = 20156160.

The previous prime is 51265099. The next prime is 51265111. The reversal of 51265100 is 156215.

51265100 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×51265100² = 5256220956020000, which contains 22 as substring.

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

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 11 ways as a sum of consecutive naturals, for example, 1556 + ... + 10244.

Almost surely, 2^51265100 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 300, while the sum is 20.

The square root of 51265100 is about 7159.9650837137. The cubic root of 51265100 is about 371.4844189059.

The spelling of 51265100 in words is "fifty-one million, two hundred sixty-five thousand, one hundred".