Base | Representation |
---|---|
bin | 1001011101111000… |
… | …10101100010010000 |
3 | 111010012200120210001 |
4 | 10232330111202100 |
5 | 40402112123310 |
6 | 2200200215344 |
7 | 236643562306 |
oct | 45674254220 |
9 | 14105616701 |
10 | 5082536080 |
11 | 2178a60646 |
12 | b9a16a554 |
13 | 62cc993cb |
14 | 363028276 |
15 | 1eb30b93a |
hex | 12ef15890 |
5082536080 has 80 divisors (see below), whose sum is σ = 12157864704. Its totient is φ = 1974551040.
The previous prime is 5082536051. The next prime is 5082536099. The reversal of 5082536080 is 806352805.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (37).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2198125 + ... + 2200435.
Almost surely, 25082536080 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 5082536080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6078932352).
5082536080 is an abundant number, since it is smaller than the sum of its proper divisors (7075328624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5082536080 is a wasteful number, since it uses less digits than its factorization.
5082536080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3104 (or 3098 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 37.
The square root of 5082536080 is about 71291.9075351474. The cubic root of 5082536080 is about 1719.3336250416. Note that the first 3 decimals are identical.
Adding to 5082536080 its reverse (806352805), we get a palindrome (5888888885).
The spelling of 5082536080 in words is "five billion, eighty-two million, five hundred thirty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •