Base | Representation |
---|---|
bin | 1001011001001100… |
… | …00100000111110000 |
3 | 111000110120012211201 |
4 | 10230212010013300 |
5 | 40312021040102 |
6 | 2152232020544 |
7 | 235655003155 |
oct | 45446040760 |
9 | 14013505751 |
10 | 5043143152 |
11 | 21587a5103 |
12 | b88b31754 |
13 | 624a85c98 |
14 | 35bad222c |
15 | 1e7b29987 |
hex | 12c9841f0 |
5043143152 has 20 divisors (see below), whose sum is σ = 10108024920. Its totient is φ = 2434620608.
The previous prime is 5043143141. The next prime is 5043143159. The reversal of 5043143152 is 2513413405.
It is a self number, because there is not a number n which added to its sum of digits gives 5043143152.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5043143159) 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 3 ways as a sum of consecutive naturals, for example, 5433958 + ... + 5434885.
It is an arithmetic number, because the mean of its divisors is an integer number (505401246).
Almost surely, 25043143152 is an apocalyptic number.
It is an amenable number.
5043143152 is an abundant number, since it is smaller than the sum of its proper divisors (5064881768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5043143152 is a wasteful number, since it uses less digits than its factorization.
5043143152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10868880 (or 10868874 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 5043143152 is about 71015.0910159242. The cubic root of 5043143152 is about 1714.8801183248.
Adding to 5043143152 its reverse (2513413405), we get a palindrome (7556556557).
The spelling of 5043143152 in words is "five billion, forty-three million, one hundred forty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •