Base | Representation |
---|---|
bin | 1100110010010010… |
… | …10000010001101100 |
3 | 122201101101221102000 |
4 | 12121021100101230 |
5 | 103024230313213 |
6 | 3053045532300 |
7 | 332050435515 |
oct | 63111202154 |
9 | 18641357360 |
10 | 6864307308 |
11 | 2a027a4751 |
12 | 13b6a14090 |
13 | 855176301 |
14 | 491917a0c |
15 | 2a2963c73 |
hex | 19925046c |
6864307308 has 288 divisors, whose sum is σ = 20337408000. Its totient is φ = 1992211200.
The previous prime is 6864307301. The next prime is 6864307313. The reversal of 6864307308 is 8037034686.
It is not an unprimeable number, because it can be changed into a prime (6864307301) 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 95 ways as a sum of consecutive naturals, for example, 112529598 + ... + 112529658.
It is an arithmetic number, because the mean of its divisors is an integer number (70616000).
Almost surely, 26864307308 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 6864307308, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10168704000).
6864307308 is an abundant number, since it is smaller than the sum of its proper divisors (13473100692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6864307308 is a wasteful number, since it uses less digits than its factorization.
6864307308 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214 (or 145 counting only the distinct ones).
The product of its (nonzero) digits is 580608, while the sum is 45.
The square root of 6864307308 is about 82851.1153093306. The cubic root of 6864307308 is about 1900.4899297973.
The spelling of 6864307308 in words is "six billion, eight hundred sixty-four million, three hundred seven thousand, three hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •