Search a number
-
+
51275952 = 24327213243
BaseRepresentation
bin1100001110011…
…0100010110000
310120111002101100
43003212202300
5101111312302
65031004400
71161560400
oct303464260
9116432340
1051275952
1126a42422
1215209700
13a814100
146b4a800
15477cd1c
hex30e68b0

51275952 has 270 divisors, whose sum is σ = 184962492. Its totient is φ = 13208832.

The previous prime is 51275941. The next prime is 51275957. The reversal of 51275952 is 25957215.

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

It is not an unprimeable number, because it can be changed into a prime (51275957) 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 53 ways as a sum of consecutive naturals, for example, 1192443 + ... + 1192485.

Almost surely, 251275952 is an apocalyptic number.

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

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

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

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

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

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

The product of its digits is 31500, while the sum is 36.

The square root of 51275952 is about 7160.7228685378. The cubic root of 51275952 is about 371.5106294890.

The spelling of 51275952 in words is "fifty-one million, two hundred seventy-five thousand, nine hundred fifty-two".