Base | Representation |
---|---|
bin | 1010110000101001… |
… | …10000110011111110 |
3 | 112220121002002212010 |
4 | 11120110300303332 |
5 | 43312330230433 |
6 | 2353120552050 |
7 | 263104014300 |
oct | 53024606376 |
9 | 15817062763 |
10 | 5776805118 |
11 | 24a4946207 |
12 | 1152782626 |
13 | 710a800a6 |
14 | 3cb30d970 |
15 | 23c24ae63 |
hex | 158530cfe |
5776805118 has 48 divisors (see below), whose sum is σ = 13462761600. Its totient is φ = 1647710064.
The previous prime is 5776805113. The next prime is 5776805159. The reversal of 5776805118 is 8115086775.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5776805113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 159705 + ... + 192507.
It is an arithmetic number, because the mean of its divisors is an integer number (280474200).
Almost surely, 25776805118 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5776805118, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6731380800).
5776805118 is an abundant number, since it is smaller than the sum of its proper divisors (7685956482).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5776805118 is a wasteful number, since it uses less digits than its factorization.
5776805118 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33421 (or 33414 counting only the distinct ones).
The product of its (nonzero) digits is 470400, while the sum is 48.
The square root of 5776805118 is about 76005.2966443787. The cubic root of 5776805118 is about 1794.3035054093.
The spelling of 5776805118 in words is "five billion, seven hundred seventy-six million, eight hundred five thousand, one hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •