Base | Representation |
---|---|
bin | 1011101011001101… |
… | …01111011010000000 |
3 | 121011211110022001021 |
4 | 11311212233122000 |
5 | 100314110312331 |
6 | 2513550115224 |
7 | 311220415201 |
oct | 56546573200 |
9 | 17154408037 |
10 | 6268057216 |
11 | 2727178183 |
12 | 126b1abb14 |
13 | 78b7914c5 |
14 | 4366695a8 |
15 | 26a437211 |
hex | 1759af680 |
6268057216 has 128 divisors (see below), whose sum is σ = 13880160000. Its totient is φ = 2805841920.
The previous prime is 6268057177. The next prime is 6268057223. The reversal of 6268057216 is 6127508626.
It is a tau number, because it is divible by the number of its divisors (128).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 4479685 + ... + 4481083.
It is an arithmetic number, because the mean of its divisors is an integer number (108438750).
Almost surely, 26268057216 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 6268057216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6940080000).
6268057216 is an abundant number, since it is smaller than the sum of its proper divisors (7612102784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6268057216 is a wasteful number, since it uses less digits than its factorization.
6268057216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1530 (or 1518 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 43.
The square root of 6268057216 is about 79171.0629965267. The cubic root of 6268057216 is about 1843.7879997132.
The spelling of 6268057216 in words is "six billion, two hundred sixty-eight million, fifty-seven thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •