Base | Representation |
---|---|
bin | 10011101000011000101000 |
3 | 100200110012020 |
4 | 103220120220 |
5 | 2304134102 |
6 | 302144440 |
7 | 61512234 |
oct | 23503050 |
9 | 10613166 |
10 | 5146152 |
11 | 29a5420 |
12 | 1882120 |
13 | 10b247b |
14 | 97d5c4 |
15 | 6b9bbc |
hex | 4e8628 |
5146152 has 64 divisors (see below), whose sum is σ = 14247360. Its totient is φ = 1536000.
The previous prime is 5146147. The next prime is 5146153. The reversal of 5146152 is 2516415.
5146152 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (5146153) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26568 + ... + 26760.
It is an arithmetic number, because the mean of its divisors is an integer number (222615).
Almost surely, 25146152 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 5146152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7123680).
5146152 is an abundant number, since it is smaller than the sum of its proper divisors (9101208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5146152 is a wasteful number, since it uses less digits than its factorization.
5146152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314 (or 310 counting only the distinct ones).
The product of its digits is 1200, while the sum is 24.
The square root of 5146152 is about 2268.5131694570. The cubic root of 5146152 is about 172.6477289414.
It can be divided in two parts, 514 and 6152, that added together give a palindrome (6666).
The spelling of 5146152 in words is "five million, one hundred forty-six thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •