Search a number
-
+
5010152 = 237212781
BaseRepresentation
bin10011000111001011101000
3100102112122012
4103013023220
52240311102
6255215052
760404600
oct23071350
910375565
105010152
112912224
121817488
1310655b4
14945c00
1568e752
hex4c72e8

5010152 has 24 divisors (see below), whose sum is σ = 10928610. Its totient is φ = 2147040.

The previous prime is 5010119. The next prime is 5010163. The reversal of 5010152 is 2510105.

It can be written as a sum of positive squares in only one way, i.e., 3786916 + 1223236 = 1946^2 + 1106^2 .

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

It is an unprimeable number.

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 5 ways as a sum of consecutive naturals, for example, 5999 + ... + 6782.

Almost surely, 25010152 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 50, while the sum is 14.

The square root of 5010152 is about 2238.3368825983. The cubic root of 5010152 is about 171.1132476011.

Adding to 5010152 its reverse (2510105), we get a palindrome (7520257).

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

Divisors: 1 2 4 7 8 14 28 49 56 98 196 392 12781 25562 51124 89467 102248 178934 357868 626269 715736 1252538 2505076 5010152