Base | Representation |
---|---|
bin | 1001011010001110… |
… | …01010110000000100 |
3 | 111001001220002200201 |
4 | 10231013022300010 |
5 | 40321231233220 |
6 | 2153142020244 |
7 | 236121525166 |
oct | 45507126004 |
9 | 14031802621 |
10 | 5051821060 |
11 | 2162691a30 |
12 | b8ba17684 |
13 | 626803b40 |
14 | 35cd10936 |
15 | 1e8790d0a |
hex | 12d1cac04 |
5051821060 has 96 divisors (see below), whose sum is σ = 12500070912. Its totient is φ = 1690744320.
The previous prime is 5051821051. The next prime is 5051821063. The reversal of 5051821060 is 601281505.
It is not an unprimeable number, because it can be changed into a prime (5051821063) 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 31 ways as a sum of consecutive naturals, for example, 1047214 + ... + 1052026.
It is an arithmetic number, because the mean of its divisors is an integer number (130209072).
Almost surely, 25051821060 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 5051821060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6250035456).
5051821060 is an abundant number, since it is smaller than the sum of its proper divisors (7448249852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5051821060 is a wasteful number, since it uses less digits than its factorization.
5051821060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5213 (or 5211 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 28.
The square root of 5051821060 is about 71076.1637963108. The cubic root of 5051821060 is about 1715.8631722033.
The spelling of 5051821060 in words is "five billion, fifty-one million, eight hundred twenty-one thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •