Base | Representation |
---|---|
bin | 1001011001010111… |
… | …00100001011000000 |
3 | 111000120021110220010 |
4 | 10230223210023000 |
5 | 40312403211102 |
6 | 2152322544520 |
7 | 236003160225 |
oct | 45453441300 |
9 | 14016243803 |
10 | 5044585152 |
11 | 215959a542 |
12 | b89508140 |
13 | 62516c439 |
14 | 35bd8994c |
15 | 1e7d11d6c |
hex | 12cae42c0 |
5044585152 has 56 divisors (see below), whose sum is σ = 13399196976. Its totient is φ = 1674969088.
The previous prime is 5044585123. The next prime is 5044585157. The reversal of 5044585152 is 2515854405.
It is a self number, because there is not a number n which added to its sum of digits gives 5044585152.
It is not an unprimeable number, because it can be changed into a prime (5044585157) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1773 + ... + 100460.
Almost surely, 25044585152 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 5044585152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6699598488).
5044585152 is an abundant number, since it is smaller than the sum of its proper divisors (8354611824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5044585152 is a wasteful number, since it uses less digits than its factorization.
5044585152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102505 (or 102495 counting only the distinct ones).
The product of its (nonzero) digits is 160000, while the sum is 39.
The square root of 5044585152 is about 71025.2430618861. The cubic root of 5044585152 is about 1715.0435495689.
The spelling of 5044585152 in words is "five billion, forty-four million, five hundred eighty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •