Base | Representation |
---|---|
bin | 10011101110000000000000 |
3 | 100201121202002 |
4 | 103232000000 |
5 | 2310403102 |
6 | 302443132 |
7 | 61636262 |
oct | 23560000 |
9 | 10647662 |
10 | 5169152 |
11 | 2a1072a |
12 | 18934a8 |
13 | 10bca91 |
14 | 987b32 |
15 | 6c1902 |
hex | 4ee000 |
5169152 has 28 divisors (see below), whose sum is σ = 10354056. Its totient is φ = 2580480.
The previous prime is 5169149. The next prime is 5169187. The reversal of 5169152 is 2519615.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7877 + ... + 8507.
Almost surely, 25169152 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 5169152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5177028).
5169152 is an abundant number, since it is smaller than the sum of its proper divisors (5184904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5169152 is an frugal number, since it uses more digits than its factorization.
5169152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 657 (or 633 counting only the distinct ones).
The product of its digits is 2700, while the sum is 29.
The square root of 5169152 is about 2273.5769175464. The cubic root of 5169152 is about 172.9045549233.
The spelling of 5169152 in words is "five million, one hundred sixty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •