Base | Representation |
---|---|
bin | 1001100111110100… |
… | …00010001110000000 |
3 | 111100000101210010110 |
4 | 10303322002032000 |
5 | 41034422200002 |
6 | 2212333231320 |
7 | 242004510033 |
oct | 46372021600 |
9 | 14300353113 |
10 | 5165818752 |
11 | 2210a740a6 |
12 | 1002032540 |
13 | 6443089b3 |
14 | 37010701a |
15 | 2037ace6c |
hex | 133e82380 |
5165818752 has 64 divisors (see below), whose sum is σ = 13801199760. Its totient is φ = 1711964160.
The previous prime is 5165818709. The next prime is 5165818783. The reversal of 5165818752 is 2578185615.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 27552 + ... + 105312.
Almost surely, 25165818752 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 5165818752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6900599880).
5165818752 is an abundant number, since it is smaller than the sum of its proper divisors (8635381008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5165818752 is a wasteful number, since it uses less digits than its factorization.
5165818752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77951 (or 77939 counting only the distinct ones).
The product of its digits is 672000, while the sum is 48.
The square root of 5165818752 is about 71873.6304356473. The cubic root of 5165818752 is about 1728.6738198626.
The spelling of 5165818752 in words is "five billion, one hundred sixty-five million, eight hundred eighteen thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •