Base | Representation |
---|---|
bin | 1100101010111111… |
… | …10011111011000000 |
3 | 122120010020212200220 |
4 | 12111133303323000 |
5 | 102413044032431 |
6 | 3043022143040 |
7 | 330405331440 |
oct | 62537637300 |
9 | 18503225626 |
10 | 6803111616 |
11 | 29811a74a4 |
12 | 139a421a80 |
13 | 84559b042 |
14 | 487748120 |
15 | 29c3c6b96 |
hex | 1957f3ec0 |
6803111616 has 112 divisors (see below), whose sum is σ = 20733812736. Its totient is φ = 1928392704.
The previous prime is 6803111563. The next prime is 6803111647. The reversal of 6803111616 is 6161113086.
It is a tau number, because it is divible by the number of its divisors (112).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 150760 + ... + 190616.
It is an arithmetic number, because the mean of its divisors is an integer number (185123328).
Almost surely, 26803111616 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 6803111616, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10366906368).
6803111616 is an abundant number, since it is smaller than the sum of its proper divisors (13930701120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6803111616 is a wasteful number, since it uses less digits than its factorization.
6803111616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40006 (or 39996 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 33.
The square root of 6803111616 is about 82480.9772977988. The cubic root of 6803111616 is about 1894.8254043257.
The spelling of 6803111616 in words is "six billion, eight hundred three million, one hundred eleven thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •