[go: up one dir, main page]

Search a number
-
+
51049152 = 26327111151
BaseRepresentation
bin1100001010111…
…1001011000000
310120001120021100
43002233023000
5101032033102
65022054400
71156624230
oct302571300
9116046240
1051049152
11268a7a90
121511a400
13a764acb
146acbcc0
154735a1c
hex30af2c0

51049152 has 168 divisors, whose sum is σ = 182587392. Its totient is φ = 13248000.

The previous prime is 51049151. The next prime is 51049183. The reversal of 51049152 is 25194015.

It is a tau number, because it is divible by the number of its divisors (168).

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

Almost surely, 251049152 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

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

The square root of 51049152 is about 7144.8689281190. The cubic root of 51049152 is about 370.9620737986.

The spelling of 51049152 in words is "fifty-one million, forty-nine thousand, one hundred fifty-two".