Base | Representation |
---|---|
bin | 1001011001110010… |
… | …01110101011110000 |
3 | 111000211000110110210 |
4 | 10230321032223300 |
5 | 40314312322102 |
6 | 2152531424120 |
7 | 236045466330 |
oct | 45471165360 |
9 | 14024013423 |
10 | 5048167152 |
11 | 2160616776 |
12 | b8a755040 |
13 | 625b24972 |
14 | 35c63d0c0 |
15 | 1e82bd36c |
hex | 12ce4eaf0 |
5048167152 has 80 divisors (see below), whose sum is σ = 15688559360. Its totient is φ = 1366419456.
The previous prime is 5048167151. The next prime is 5048167169. The reversal of 5048167152 is 2517618405.
It is a super-2 number, since 2×50481671522 = 50967983189063582208, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5048167152.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5048167151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 388993 + ... + 401760.
It is an arithmetic number, because the mean of its divisors is an integer number (196106992).
Almost surely, 25048167152 is an apocalyptic number.
It is an amenable number.
5048167152 is an abundant number, since it is smaller than the sum of its proper divisors (10640392208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5048167152 is a wasteful number, since it uses less digits than its factorization.
5048167152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 790790 (or 790784 counting only the distinct ones).
The product of its (nonzero) digits is 67200, while the sum is 39.
The square root of 5048167152 is about 71050.4549739127. The cubic root of 5048167152 is about 1715.4493862123.
The spelling of 5048167152 in words is "five billion, forty-eight million, one hundred sixty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •