Search a number
-
+
51011112 = 2332125463
BaseRepresentation
bin1100001010010…
…1111000101000
310112222122002110
43002211320220
5101024323422
65021202320
71156405305
oct302457050
9115878073
1051011112
1126881449
12151003a0
13a7506b9
146abc0ac
15472960c
hex30a5e28

51011112 has 16 divisors (see below), whose sum is σ = 127527840. Its totient is φ = 17003696.

The previous prime is 51011071. The next prime is 51011113. The reversal of 51011112 is 21111015.

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

It is not an unprimeable number, because it can be changed into a prime (51011113) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1062708 + ... + 1062755.

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

Almost surely, 251011112 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 10, while the sum is 12.

The square root of 51011112 is about 7142.2063817843. The cubic root of 51011112 is about 370.8699083509.

Adding to 51011112 its reverse (21111015), we get a palindrome (72122127).

The spelling of 51011112 in words is "fifty-one million, eleven thousand, one hundred twelve".

Divisors: 1 2 3 4 6 8 12 24 2125463 4250926 6376389 8501852 12752778 17003704 25505556 51011112