Base | Representation |
---|---|
bin | 10011000111011011010000 |
3 | 100102121000020 |
4 | 103013123100 |
5 | 2240324102 |
6 | 255223440 |
7 | 60410526 |
oct | 23073320 |
9 | 10377006 |
10 | 5011152 |
11 | 2912a53 |
12 | 1817b80 |
13 | 1065ba3 |
14 | 946316 |
15 | 68ebbc |
hex | 4c76d0 |
5011152 has 20 divisors (see below), whose sum is σ = 12945600. Its totient is φ = 1670368.
The previous prime is 5011151. The next prime is 5011189. The reversal of 5011152 is 2511105.
It is a super-2 number, since 2×50111522 = 50223288734208, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5011151) 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, 52152 + ... + 52247.
It is an arithmetic number, because the mean of its divisors is an integer number (647280).
Almost surely, 25011152 is an apocalyptic number.
It is an amenable number.
5011152 is an abundant number, since it is smaller than the sum of its proper divisors (7934448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5011152 is a wasteful number, since it uses less digits than its factorization.
5011152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104410 (or 104404 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 15.
The square root of 5011152 is about 2238.5602515903. The cubic root of 5011152 is about 171.1246312787.
Adding to 5011152 its reverse (2511105), we get a palindrome (7522257).
It can be divided in two parts, 501 and 1152, that added together give a triangular number (1653 = T57).
The spelling of 5011152 in words is "five million, eleven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •