Base | Representation |
---|---|
bin | 1001011001001011… |
… | …01111100010111110 |
3 | 111000110101221020110 |
4 | 10230211233202332 |
5 | 40312010341003 |
6 | 2152230130450 |
7 | 235654202364 |
oct | 45445574276 |
9 | 14013357213 |
10 | 5043058878 |
11 | 2158747860 |
12 | b88ab0a26 |
13 | 624a56810 |
14 | 35baad634 |
15 | 1e7b0ea03 |
hex | 12c96f8be |
5043058878 has 64 divisors (see below), whose sum is σ = 12258086400. Its totient is φ = 1361996160.
The previous prime is 5043058841. The next prime is 5043058879. The reversal of 5043058878 is 8788503405.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5043058879) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 76458 + ... + 126221.
It is an arithmetic number, because the mean of its divisors is an integer number (191532600).
Almost surely, 25043058878 is an apocalyptic number.
5043058878 is a gapful number since it is divisible by the number (58) formed by its first and last digit.
5043058878 is an abundant number, since it is smaller than the sum of its proper divisors (7215027522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5043058878 is a wasteful number, since it uses less digits than its factorization.
5043058878 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202737.
The product of its (nonzero) digits is 1075200, while the sum is 48.
The square root of 5043058878 is about 71014.4976606890. The cubic root of 5043058878 is about 1714.8705660405.
The spelling of 5043058878 in words is "five billion, forty-three million, fifty-eight thousand, eight hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •