Base | Representation |
---|---|
bin | 1001100110001111… |
… | …10100101000000000 |
3 | 111022002122001001101 |
4 | 10303013310220000 |
5 | 41023034441442 |
6 | 2211143144144 |
7 | 241454565220 |
oct | 46307645000 |
9 | 14262561041 |
10 | 5152655872 |
11 | 22045a3691 |
12 | bb9745054 |
13 | 64167a600 |
14 | 36c47c080 |
15 | 20255ccb7 |
hex | 1331f4a00 |
5152655872 has 240 divisors, whose sum is σ = 13083662592. Its totient is φ = 1984020480.
The previous prime is 5152655863. The next prime is 5152655887. The reversal of 5152655872 is 2785562515.
Its product of digits (840000) is a multiple of the sum of its prime divisors (250).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 28467622 + ... + 28467802.
Almost surely, 25152655872 is an apocalyptic number.
5152655872 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5152655872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6541831296).
5152655872 is an abundant number, since it is smaller than the sum of its proper divisors (7931006720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5152655872 is a wasteful number, since it uses less digits than its factorization.
5152655872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279 (or 250 counting only the distinct ones).
The product of its digits is 840000, while the sum is 46.
The square root of 5152655872 is about 71782.0024240060. The cubic root of 5152655872 is about 1727.2043090193.
The spelling of 5152655872 in words is "five billion, one hundred fifty-two million, six hundred fifty-five thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •