Base | Representation |
---|---|
bin | 1001011010110010… |
… | …01011100100011000 |
3 | 111001101202222222101 |
4 | 10231121023210120 |
5 | 40323433334000 |
6 | 2153431133144 |
7 | 236206622605 |
oct | 45531134430 |
9 | 14041688871 |
10 | 5056543000 |
11 | 2165317663 |
12 | b915141b4 |
13 | 6277981a2 |
14 | 35d7bd6ac |
15 | 1e8dc4e6a |
hex | 12d64b918 |
5056543000 has 32 divisors (see below), whose sum is σ = 11832312960. Its totient is φ = 2022616800.
The previous prime is 5056542991. The next prime is 5056543013. The reversal of 5056543000 is 3456505.
It is a super-2 number, since 2×50565430002 = 51137254221698000000, 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 5056543000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2527272 + ... + 2529271.
It is an arithmetic number, because the mean of its divisors is an integer number (369759780).
Almost surely, 25056543000 is an apocalyptic number.
5056543000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5056543000 is an abundant number, since it is smaller than the sum of its proper divisors (6775769960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5056543000 is a wasteful number, since it uses less digits than its factorization.
5056543000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5056564 (or 5056550 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 28.
The square root of 5056543000 is about 71109.3735030762. The cubic root of 5056543000 is about 1716.3976118165.
Adding to 5056543000 its reverse (3456505), we get a palindrome (5059999505).
The spelling of 5056543000 in words is "five billion, fifty-six million, five hundred forty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •